Approximate string matching using compressed suffix arrays

DOI10.1016/j.tcs.2005.11.022zbMath1086.68038OpenAlexW2153083979MaRDI QIDQ818136

Wing-Kin Sung, Trinh N. D. Huynh, Wing-Kai Hon, Tak-Wah Lam

Publication date: 24 March 2006

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

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

zbMATH Keywords

bits indexing data structure

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (8)

Document retrieval with one wildcard ⋮ Less space: indexing for queries with wildcards ⋮ Upper and Lower Bounds for Dynamic Data Structures on Strings ⋮ Fast circular dictionary-matching algorithm ⋮ Searching and Indexing Circular Patterns ⋮ A randomized numerical aligner (rNA) ⋮ Indexing Circular Patterns ⋮ Streaming dictionary matching with mismatches

Cites Work

• A fast string searching algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Dictionary matching and indexing with errors and don't cares
• Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• The String-to-String Correction Problem
• New and faster filters for multiple approximate string matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate string matching using compressed suffix arrays