Results 71 to 80 of about 1,556 (153)

FastGA: fast genome alignment. [PDF]

Bioinform Adv
Myers G, Durbin R, Zhou C.
europepmc   +2 more sources

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

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

Genome Res
Varki R, Boucher C.
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

A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. [PDF]

Bioinformatics, 2009
Khan Z, Bloom JS, Kruglyak L, Singh M.
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

MarkerMatch: a proximity-based probe-matching algorithm for joint analysis of copy-number variants from different genotyping arrays. [PDF]

Bioinformatics
Ivankovic F, Yu D, Shen J, Zhan L, Niarchou M, Kaylor A, Domènech L, Miller-Fleming TW, Porras LM, Giusti-Rodríguez P, Ophoff RA, Scharf JM, Mathews CA.   +12 more
europepmc   +1 more source

Elucidating Transitions of <i>k</i>-mer-Based Objects Across <i>k</i>-mer Sizes. [PDF]

J Comput Biol
Park A, Koslicki D.
europepmc   +1 more source

Faster computation of left-bounded shortest unique substrings. [PDF]

Algorithms Mol Biol
Aguiar LLM, Louza FA.
europepmc   +1 more source

Fast sequence alignment for centromeres with RaMA. [PDF]

Genome Res
Zhang P, Wei Y, Tian Q, Zou Q, Wang Y.
europepmc   +1 more source