Results 171 to 180 of about 679,088 (213)
Early hexapod genomes reveal the deep origin of insect gustatory and odorant receptors. [PDF]
Nat CommunMitchell RF, Moran KM, McKenna DD.
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 +4 more sources
Algorithmica, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Kyue Kim +2 more
exaly +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong Kyue Kim +2 more
exaly +4 more sources
Efficient implementation of lazy suffix trees [PDF]
Software - Practice and Experience, 2003 Giegerich R, Kurtz S, Stoye J. Efficient implementation of lazy suffix trees. SOFTWARE-PRACTICE & EXPERIENCE. 2003;33(11):1035-1049.We present an efficient implementation of a write-only top-down construction for suffix trees.
Jens Stoye
exaly +2 more sources
Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +1 more source
From Suffix Trees to Suffix Vectors
International Journal of Foundations of Computer Science, 2006We present a first formal setting for suffix vectors that are space economical alternative data structures to suffix trees. We give two linear algorithms for converting a suffix tree into a suffix vector and conversely. We enrich suffix vectors with formulas for counting the number of occurrences of repeated substrings.
Élise Prieur, Thierry Lecroq
openaire +5 more sources
International Journal of Foundations of Computer Science, 2009
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source
Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arne Andersson +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arne Andersson +2 more
openaire +3 more sources
Practical methods for constructing suffix trees [PDF]
VLDB Journal, 2005 Sequence datasets are ubiquitous in modern life-science applications, and querying sequences is a common and critical operation in many of these applications.
Yuanyuan Tian +2 more
exaly +2 more sources