BWT: An Index Structure to Speed-Up Both Exact and Inexact String Matching
Author:
Chen Yangjun,Wu Yujia
Publisher
Springer Singapore
Reference57 articles.
1. Li, R., et al. (2008). SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713–714.
2. Amir, A., Lewenstein, M., & Porat, E. (2004). Faster algorithms for string matching with k mismatches. Journal of Algorithms, 50(2), 257–275.
3. Aoe, J.-I. (1989). An efficient implementation of static string pattern matching machines. IEEE Transactions on Software Engineering, 15(8), 1010–1016.
4. Baeza-Yates, R. A., Perleberg, C. H. Fast and practical approximate string matching. In A. Apostolico, M. Crocchemore, Z. Galil, & U. Manber (Eds.), Combinatorial pattern matching, lecture notes in computer science (Vol. 644, pp. 185–192). Berlin: Springer.
5. Baeza-Yates, R. A., & Régnier, M. Fast algorithms for two-dimensional and multiple pattern matching. In Proceedings of the SWAT ‘90 the Second Scandinavian Workshop on Algorithm Theory (pp. 332–347). Bergen, Sweden: Springer.