A comparison of BWT approaches to string pattern matching

DOI10.1002/SPE.669zbMath1080.68566OpenAlexW2042758915MaRDI QIDQ5704751

Andrew Firth, Amar Chandra Mukherjee, Don A. Adjeroh, Tim Bell

Publication date: 15 November 2005

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.669

zbMATH Keywords

binary searchsuffix arraysBWTFM-index\(q\)-gramscompressed pattern matching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Uses Software

• Canterbury

Cites Work

• Algorithms on Strings, Trees and Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A comparison of BWT approaches to string pattern matching