Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree

DOI10.1007/978-3-319-15579-1_8zbMath1423.68120OpenAlexW1933764646MaRDI QIDQ2799166

Bastien Cazaux, Thierry Lecroq, Eric Rivals

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15579-1_8

zbMATH Keywords

de Bruijn graphstringologyspace complexitytext algorithmsassemblydynamic updateindexing data structures

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Linking indexing data structures to de Bruijn graphs: construction and update ⋮ Small-space LCE data structure with constant-time queries

Cites Work

• Unnamed Item
• Unnamed Item
• Truncated suffix trees and their application to data compression.
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• An Eulerian path approach to DNA fragment assembly
• Succinct de Bruijn Graphs
• Approximating Shortest Superstring Problem Using de Bruijn Graphs
• From Indexing Data Structures to de Bruijn Graphs

This page was built for publication: Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree