Faster computation of left-bounded shortest unique substrings. [PDF]
Aguiar LLM, Louza FA.
europepmc +1 more source
A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. [PDF]
Khan Z, Bloom JS, Kruglyak L, Singh M.
europepmc +1 more source
Fast sequence alignment for centromeres with RaMA. [PDF]
Zhang P, Wei Y, Tian Q, Zou Q, Wang Y.
europepmc +1 more source
Col-BWT: Pangenomic Seed Chaining with Maximal Matches Improves Read Classification. [PDF]
Brown NK, Shivakumar VS, Langmead B.
europepmc +1 more source
Space-time Trade-offs for the LCP Array of Wheeler DFAs. [PDF]
Cotumaccio N +3 more
europepmc +1 more source
Mumemto: efficient maximal matching across pangenomes. [PDF]
Shivakumar VS, Langmead B.
europepmc +1 more source
Automation and machine learning drive rapid optimization of isoprenol production in Pseudomonas putida. [PDF]
Carruthers DN +15 more
europepmc +1 more source
Generating multiple alignments on a pangenomic scale. [PDF]
Olbrich J, Büchler T, Ohlebusch E.
europepmc +1 more source
Efficient Construction and Utilization of k-Ordered FM-indexes with kISS for Ultra-Fast Read Mapping in Large Genomes. [PDF]
Yang ZD, Kuo HY, Hsieh PW, Hung JH.
europepmc +1 more source
Computing Suffix Links for Suffix Trees and Arrays
We present a new and simple algorithm to reconstruct suffix links in suffix trees and suffix arrays. The algorithm is based on observations regarding suffix tree construction algorithms. With our algorithm we bring suffix arrays even closer to the ease of use and implementation of suffix trees.
openaire +1 more source

