Results 161 to 170 of about 58,956 (207)

Uncovering hundreds of exogenous and endogenous RNA viral RdRp sequences amongst uncharacterized sequences in public protein databases. [PDF]

Virus Evol
Brown K, Firth AE.
europepmc   +1 more source

Data collected in a citizen scientist study uncover a new species record of Phoxinus minnow for Austria. [PDF]

Environ Monit Assess
Chai MJ, Bogutskaya NG, Reier S, Friedrich R, Rund H, Wanzenböck S, Wanzenböck J, Glaser F, Marcante S, Prowatke I, Jung M, Mikschi E, Palandačić A.   +12 more
europepmc   +1 more source

Run-length compressed metagenomic read classification with SMEM-finding and tagging. [PDF]

iScience
Depuydt L, Ahmed OY, Fostier J, Langmead B, Gagie T.   +4 more
europepmc   +1 more source

Evaluating the phylogenetic signal of morphosyntax. [PDF]

Pozn Stud Contemp Linguist
Sleeman R, Makri MM, Anagnostopoulou E, Ladoukakis ED, Michelioudakis D, Zioutis C, Pavlidis P.   +6 more
europepmc   +1 more source

Snail plots are badges of genome assembly quality

Challis R, Blaxter M.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Suffix Tree Detection

Lecture Notes in Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir, Eitan Kondratovsky, Avivit Levy   +2 more
exaly   +2 more sources

From Suffix Trees to Suffix Vectors

International Journal of Foundations of Computer Science, 2006
We 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   +4 more sources

THE VIRTUAL SUFFIX TREE

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, Yue Jiang 0001, Donald A. Adjeroh   +2 more
openaire   +1 more source

Suffix Trees on Words

Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arne Andersson, N. Jesper Larsson, Kurt Swanson   +2 more
openaire   +2 more sources

REACHABILITY ON SUFFIX TREE GRAPHS

International Journal of Foundations of Computer Science, 2008
We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda   +3 more
openaire   +3 more sources