Results 111 to 120 of about 1,556 (153)
PERC: a suite of software tools for the curation of cryoEM data with application to simulation, modeling and machine learning. [PDF]
Acta Crystallogr F Struct Biol CommunCosta-Gomes B +10 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computing suffix links for suffix trees and arrays
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
2007
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1, n], taking O(n) time and O(k) space in addition to T. We propose a class-note solution to this problem that achieves such optimal time and space bounds.
FERRAGINA, PAOLO, FISCHER J.
openaire +1 more source
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1, n], taking O(n) time and O(k) space in addition to T. We propose a class-note solution to this problem that achieves such optimal time and space bounds.
FERRAGINA, PAOLO, FISCHER J.
openaire +1 more source
J. Autom. Lang. Comb., 2003
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Frantisek Franek +3 more
openaire +2 more sources
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Frantisek Franek +3 more
openaire +2 more sources
2000
Suffix array is a data structure that can be used to index a large text file so that queries of its content can be answered quickly. Basically a suffix array is an array of all suffixes of the text in the lexicographic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suffix array.
openaire +1 more source
Suffix array is a data structure that can be used to index a large text file so that queries of its content can be answered quickly. Basically a suffix array is an array of all suffixes of the text in the lexicographic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suffix array.
openaire +1 more source
Sampled suffix array with minimizers
Software: Practice and Experience, 2017SummarySampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claudeet al.showed an alphabet sampling scheme allowing for more efficient pattern searches compared with the sparse suffix array, for long enough patterns.
Szymon Grabowski, Marcin Raniszewski
openaire +1 more source
Suffix Array for Large Alphabet
Data Compression Conference (dcc 2008), 2008Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression ratio. Suffix arrays are used in the coding phase of BWT and we focus on creating them for an alphabet larger than 256 symbols. The motivation for this work has been software project XBW-an application for compression of large
Radovan Sesták +2 more
openaire +1 more source
Compressed Compact Suffix Arrays
2004The compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static text. Compared to other compressed suffix arrays (Grossi and Vitter, Sadakane, Ferragina and Manzini), the CSA is significantly larger (2.7 times the text size, as opposed to 0.6–0.8 of compressed suffix arrays).
Veli Mäkinen, Gonzalo Navarro 0001
openaire +1 more source
Data Compression Conference (dcc 2008), 2008
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. DCA takes advantage of words that do not occur as factors in the text, i.e. that are forbidden. Due to these forbidden words (antiwords), some symbols in the text can be predicted.
Martin Fiala, Jan Holub 0001
openaire +1 more source
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. DCA takes advantage of words that do not occur as factors in the text, i.e. that are forbidden. Due to these forbidden words (antiwords), some symbols in the text can be predicted.
Martin Fiala, Jan Holub 0001
openaire +1 more source
Property Suffix Array with Applications
2018The suffix array is one of the most prevalent data structures for string indexing; it stores the lexicographically sorted list of suffixes of a given string. Its practical advantage compared to the suffix tree is space efficiency. In Property Indexing, we are given a string x of length n and a property \(\varPi \), i.e.
Panagiotis Charalampopoulos +3 more
openaire +1 more source