JOURNAL ARTICLE

Approximate string matching using compressed suffix arrays

Trinh HuynhWing-Kai HonTak‐Wah LamWing‐Kin Sung

Year: 2005 Journal:   Theoretical Computer Science Vol: 352 (1-3)Pages: 240-249   Publisher: Elsevier BV
Keywords:
Search engine indexing Suffix Compressed suffix array Hamming distance Combinatorics Suffix array Data structure String searching algorithm Mathematics Pattern matching String (physics) Matching (statistics) Suffix tree Computer science Algorithm

Metrics

43
Cited By
4.22
FWCI (Field Weighted Citation Impact)
35
Refs
0.95
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
Network Packet Processing and Optimization
Physical Sciences →  Computer Science →  Hardware and Architecture
DNA and Biological Computing
Life Sciences →  Biochemistry, Genetics and Molecular Biology →  Molecular Biology

Related Documents

BOOK-CHAPTER

Approximate String Matching Using Compressed Suffix Arrays

Trinh HuynhWing-Kai HonTak‐Wah LamWing‐Kin Sung

Lecture notes in computer science Year: 2004 Pages: 434-444
BOOK-CHAPTER

Approximate string-matching over suffix trees

Esko Ukkonen

Lecture notes in computer science Year: 2005 Pages: 228-242
JOURNAL ARTICLE

Approximate string matching with suffix automata

Esko UkkonenDerick Wood

Journal:   Algorithmica Year: 1993 Vol: 10 (5)Pages: 353-364
© 2026 ScienceGate Book Chapters — All rights reserved.