scientific article; zbMATH DE number 7559194

DOI10.4230/LIPIcs.CPM.2019.26MaRDI QIDQ5088917

Travis Gagie, Diego Díaz-Domínguez, Gonzalo Navarro

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1901.10453

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

de Bruijn graphDNA sequencingoverlap graphsuccinct ordinal trees

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• Space efficient linear time construction of suffix arrays
• Fully Functional Static and Dynamic Succinct Trees
• Compressed representations of sequences and full-text indexes
• Linear work suffix array construction
• Indexing compressed text
• Linear-Time Construction of Suffix Arrays
• Succinct de Bruijn Graphs
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Faster Compressed Suffix Trees for Repetitive Collections