Results 151 to 160 of about 37,210 (201)
Whole-genome sequencing bulked segregant analysis uncovered FW7, a Fusarium wilt resistance gene masked by epistasis in octoploid strawberry. [PDF]
Vachev MV +12 more
europepmc +1 more source
Labeled dataset of X-ray protein ligand images in 3D point cloud and validated deep learning models. [PDF]
Bazzano CF +3 more
europepmc +1 more source
b-move: faster lossless approximate pattern matching in a run-length compressed index. [PDF]
Depuydt L +5 more
europepmc +1 more source
Formal verification of bioinformatics software using model checking and theorem proving. [PDF]
Weerasena H +3 more
europepmc +1 more source
A multi-dimensional DNS domain intelligence dataset for cybersecurity research. [PDF]
Hranický R +6 more
europepmc +1 more source
The FORGENIUS Genomic Resources: New Genotyping Tools and Genomic Data for 23 Forest Tree Species and Their Genetic Conservation Units. [PDF]
Pinosio S +14 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
exaly +2 more sources
Property Suffix Array with Applications
Lecture Notes in Computer Science, 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 +2 more
exaly +2 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

