Results 101 to 110 of about 301,848 (186)

Faster run-length compressed suffix arrays. [PDF]

Oasics
Brown NK, Gagie T, Manzini G, Navarro G, Sciortino M.   +4 more
europepmc   +1 more source

Applications of V-Order: Suffix arrays, the Burrows-Wheeler transform & the FM-index

, 2018
V-order is a total order on strings that determines an instance of Unique Maximal Factorization Families (UMFFs), a generalization of Lyndon words. The fundamental V-comparison of strings can be done in linear time and constant space.
Rahman, M.S., Smyth, W.F., Mhaskar, N., Daykin, J.W., Alatabbi, A.   +4 more
core  

Inexact Local Alignment Search over Suffix Arrays. [PDF]

Proceedings (IEEE Int Conf Bioinformatics Biomed), 2009
Ghodsi M, Pop M.
europepmc   +1 more source

Suffixient Arrays: A New Efficient Suffix Array Compression Technique. [PDF]

Theory Comput Syst
Cenzato D, Depuydt L, Gagie T, Kim SH, Manzini G, Olivares F, Prezza N.   +6 more
europepmc   +1 more source

Lossless pangenome indexing using tag arrays. [PDF]

Algorithms Mol Biol
Eskandar P, Paten B, Sirén J.
europepmc   +1 more source

Pattern matching with Elastic-Degenerate strings and Elastic-Founder graphs. [PDF]

Algorithms Mol Biol
Ascone R, Bernardini G, Conte A, Equi M, Gabory E, Grossi R, Pisanti N.   +6 more
europepmc   +1 more source

Prefix-free parsing for merging big BWTs. [PDF]

Int Symp String Process Inf Retr
Díaz-Domínguez D, Gagie T, Guerrini V, Langmead B, Lipták Z, Manzini G, Masillo F, Shivakumar V.   +7 more
europepmc   +1 more source

Agreement Marking May Facilitate Noun Class Learning in Children But Not Adults. [PDF]

Open Mind (Camb)
Tal S, Smith K, Culbertson J.
europepmc   +1 more source

A novel linear indexing method for strings under all internal nodes in a suffix tree. [PDF]

Front Bioinform
Al-Okaily A, Tbakhi A.
europepmc   +1 more source

Building genomic data structures from compressed representations using prefix-free parsing. [PDF]

Genome Res
Varki R, Boucher C.
europepmc   +1 more source