Approximate string matching using compressed suffix arrays

DOI10.1016/J.TCS.2005.11.022zbMATH Open1086.68038OpenAlexW2153083979MaRDI QIDQ818136FDOQ818136

Wing-Kin Sung, Trinh 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

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

zbMATH Keywords

bits indexing data structure

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

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

Cited In (15)

• Combinatorial Pattern Matching
• Indexing Circular Patterns
• Binary jumbled string matching for highly run-length compressible texts
• Streaming dictionary matching with mismatches
• Approximate string matching with suffix automata
• Upper and Lower Bounds for Dynamic Data Structures on Strings
• Document retrieval with one wildcard
• Less space: indexing for queries with wildcards
• Searching and Indexing Circular Patterns
• A randomized numerical aligner (rNA)
• Approximate string matching using factor automata
• Approximate matching of run-length compressed strings
• Fast circular dictionary-matching algorithm
• Approximate string matching with compressed indexes
• Title not available (Why is that?)

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)