On demand string sorting over unbounded alphabets

DOI10.1016/j.tcs.2011.12.001zbMath1243.68167OpenAlexW2117767048MaRDI QIDQ418735

Dafna Sheinwald, Carmel Kent, Moshe Lewenstein

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.001

zbMATH Keywords

data structuresstring matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Near-optimal quantum algorithms for string problems ⋮ Engineering parallel string sorting

Uses Software

• DB2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting strings and constructing digital search trees in parallel
• On-line construction of suffix trees
• Suffix trays and suffix trists: structures for faster text indexing
• Optimal parallel string algorithms
• Suffix Arrays: A New Method for On-Line String Searches
• Cache-efficient string sorting using copying
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• A Space-Economical Suffix Tree Construction Algorithm
• Dynamic Binary Search
• Merging and sorting strings in parallel
• On the sorting-complexity of suffix tree construction

This page was built for publication: On demand string sorting over unbounded alphabets