Approximate string matching using compressed suffix arrays

DOI10.1016/J.TCS.2005.11.022MaRDI QIDQ818136zbMATH OpenOpenAlexFDO

Authors Trinh Huynh, Wing-Kai Hon, Tak-Wah Lam, Wing-Kin Sung

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)

Recommendations

• Combinatorial Pattern Matching
• Improved approximate string matching using compressed suffix data structures
• Algorithms and Computation
• Compressed Indexes for Approximate String Matching
• Compressed indexes for approximate string matching

Cites work

• scientific article; zbMATH DE number 1615292 (Why is no real title available?)
• scientific article; zbMATH DE number 1670652 (Why is no real title available?)
• scientific article; zbMATH DE number 2185612 (Why is no real title available?)
• scientific article; zbMATH DE number 2185640 (Why is no real title available?)
• scientific article; zbMATH DE number 176144 (Why is no real title available?)
• scientific article; zbMATH DE number 2149348 (Why is no real title available?)
• scientific article; zbMATH DE number 1445379 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• A fast string searching algorithm
• Algorithms on Strings, Trees and Sequences
• Breaking a time-and-space barrier in constructing full-text indices
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Dictionary matching and indexing with errors and don't cares
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Linear-time construction of suffix arrays (extended abstract)
• New and faster filters for multiple approximate string matching
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• The String-to-String Correction Problem

Cited in

(20)

• Approximate string matching with suffix automata
• Compressed Indexes for Approximate String Matching
• Improved approximate string matching using compressed suffix data structures
• Streaming dictionary matching with mismatches
• Document retrieval with one wildcard
• Algorithms and Computation
• Lower bounds for text indexing with mismatches and differences
• Approximate matching of run-length compressed strings
• scientific article; zbMATH DE number 1786446 (Why is no real title available?)
• Combinatorial Pattern Matching
• Compressed indexes for approximate string matching
• Searching and indexing circular patterns
• Fast circular dictionary-matching algorithm
• A randomized numerical aligner (rNA)
• Approximate string matching using factor automata
• Approximate string matching with compressed indexes
• Indexing Circular Patterns
• Upper and lower bounds for dynamic data structures on strings
• Binary jumbled string matching for highly run-length compressible texts
• Less space: indexing for queries with wildcards

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

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