Scalable string similarity search/join with approximate seeds and multiple backtracking
暂无分享,去创建一个
[1] Peter Sanders,et al. Better external memory suffix array construction , 2008, JEAL.
[2] S. B. Needleman,et al. A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.
[3] Knut Reinert,et al. RazerS 3: Faster, fully sensitive read mapping , 2012, Bioinform..
[4] Eugene W. Myers. A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming , 1998, CPM.
[5] Gaston H. Gonnet,et al. A fast algorithm on average for all-against-all sequence matching , 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).
[6] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.
[7] Gonzalo Navarro,et al. A Hybrid Indexing Method for Approximate String Matching , 2007 .
[8] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[9] Esko Ukkonen,et al. Approximate String-Matching over Suffix Trees , 1993, CPM.
[10] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.
[11] Dan Gusfield. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[12] R. Durbin,et al. Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .
[13] Knut Reinert,et al. SeqAn An efficient, generic C++ library for sequence analysis , 2008, BMC Bioinformatics.
[14] Knut Reinert,et al. Fast and accurate read mapping with approximate seeds and multiple backtracking , 2012, Nucleic acids research.
[15] Donald R. Morrison,et al. PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.
[16] Robert Giegerich,et al. Efficient implementation of lazy suffix trees , 2003, Softw. Pract. Exp..
[17] M. Crochemore,et al. On-line construction of suffix trees , 2002 .
[18] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[19] Peter H. Sellers,et al. The Theory and Computation of Evolutionary Distances: Pattern Recognition , 1980, J. Algorithms.
[20] Gonzalo Navarro,et al. Faster Approximate String Matching , 1999, Algorithmica.
[21] Eugene W. Myers,et al. A fast bit-vector algorithm for approximate string matching based on dynamic programming , 1998, JACM.
[22] Richard Durbin,et al. Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .