An efficient algorithm for finding similar short substrings from large scale string data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5012 LNAI, Issue , 2008, Pages 345-356

  Uno, Takeaki ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA REDUCTION; DATABASE SYSTEMS; HAMMING DISTANCE;

EFFICIENT ALGORITHMS; LARGE SCALE STRING DATA; LOG DATA; SUBSTRINGS;

LARGE SCALE SYSTEMS;

EID: 44649147125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68125-0_31     Document Type: Conference Paper

References (13)

1. Abrahamson, K.: Generalized String Matching. SIAM J. on Comp. 16(6), 1039-1051 (1987)
2. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., Lipman, D.J.: Basic local alignment search tool. J. Mol. Biol. 215, 403-410 (1990)
3. Altschul, S.F., Madden, T.L., Schaffer, A.A., Zhang, J., Zhang, Z., Miller, Z.W., Lipman, D.J.: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res. 25, 3389-3402 (1997)
4. Amir, A., Lewenstein, M., Porat, E.: Faster Algorithms for String Matching with k Mismatches. In: Symposium on Disc. Alg., pp. 794-803 (2000)
5. Brown, P., Botstein, D.: Exploring the New World of the Genome with DNA Microarrays. Nature Genetics 21, 33-37 (2000)
6. Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An Approximate l1-difference Algorithm for Massive Data Streams. In: Proc. FOCS 1999 (1999)
7. Manber, U., Myers, G.: Suffix Arrays: A New Method for On-line String Searches. SIAM J. on Comp. 22, 935-948 (1993)
8. Muthukrishnan, S., Sahinalp, S.C.: Approximate Nearest Neighbors and Sequence Comparison with Block Operations. In: Proc. 32nd annual ACM symposium on Theory of Computing, pp. 416-424 (2000)
9. Muthukrishnan, S., Sahinalp, S.C.: Simple and Practical Sequence Nearest Neighbors under Block Edit Operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, Springer, Heidelberg (2002)
10. Pearson, W.R.: Flexible sequence similarity searching with the FASTAS program package. Methods in Molecular Biology 132, 185-219 (2000)
11. Yamada, S., Gotoh, O., Yamana, H.: Improvement in Accuracy of Multiple Sequence Alignment Using Novel Group-to-group Sequence Alignment Algorithm with Piecewise Linear Gap Cost. BMC Bioinformatics 7, 524 (2006)
12. Yamada, T., Morishita, S.: Computing Highly Specific and Mismatch Tolerant Oligomers Efficiently. In: Bioinformatics Conference (2003)
13. Yamada, T., Morishita, S.: Accelerated Off-target Search Algorithm for siRNA. Bioinformatics 21, 1316-1324 (2005)