Space-time trade-offs for the LCP array of Wheeler DFAs

DOI10.1007/978-3-031-43980-3_12MaRDI QIDQ6545421

Travis Gagie, Author name not available (Why is that?), Nicola Prezza, Dominik Köppl

Publication date: 29 May 2024

zbMATH Keywords

de Bruijn graphsLCP arraymatching statisticsWheeler graphsvariable-order de Bruijn graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Wheeler graphs: a framework for BWT-based data structures
• Wheeler languages
• Compressed suffix trees with full functionality
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Compressing and indexing labeled trees, with applications
• Optimal Succinctness for Range Minimum Queries
• An Eulerian path approach to DNA fragment assembly
• Succinct de Bruijn Graphs
• Lower bound for succinct range minimum query
• Regular Languages meet Prefix Sorting
• Spaces, Trees, and Colors

This page was built for publication: Space-time trade-offs for the LCP array of Wheeler DFAs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545421)