Slidesort: All pairs similarity search for short reads

Bioinformatics

Volumn 27, Issue 4, 2011, Pages 464-470

  Shimizu, Kana ^a   Tsuda, Koji ^a,b  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER PROGRAM; DNA SEQUENCE; METHODOLOGY; NUCLEOTIDE SEQUENCE;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 79951520746     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq677     Document Type: Article

References (22)

1. Abouelhoda, M. et al. (2004) Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms, 2, 53-86.
2. Burkhardt, S. and Kärkkäinen, J. (2002) One-gapped q-gram filters for levenshtein distance. In Proceedings of the 13th Symposium on Combinatorial Pattern Matching (CPM'f02). Vol. 2373 of Lecture Notes in Computer Science, Springer, Berlin, Germany, pp. 225-234.
3. Gower, J. and Ross, G. (1969) Minimum spanning trees and single-linkage cluster analysis. Appl. Stat., 18, 54-64.
4. Han, J. et al. (2004) Mining frequent patterns without candidate generation. Data Min. Knowl. Discov., 8, 53-87.
5. Jiang, H. andWong, W.H. (2008) Seqmap: mapping massive amount of oligonucleotides to the genome. Bioinformatics, 24, 2395-2396.
6. Kruskal, J.B. (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc., 7, 48-50.
7. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biol., 10, R25.
8. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with burrows-wheeler transform. Bioinformatics, 25, 1754-1760.
9. Li, R. et al. (2009) Soap2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
10. Lipman, D.J. and Pearson, W.R. (1985) Rapid and sensitive protein similarity searches. Science, 227, 1435-1441.
11. Manning, C. et al. (2008). Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK.
12. Prim, R. (1957) Shortest connection networks and some generalizations. Bell Syst. Tech. J., 26, 1389-1401.
13. Qu, W. et al. (2009) Efficient frequency-based de novo short-read clustering for error trimming in next-generation sequencing. Genome Res., 19, 1309-1315.
14. Rajasekaran, S. et al. (2005) High-performance exact algorithms for motif search. J. Clin. Monit. Comput., 19, 319-328.
15. Sagot, M.-F. (1998) Spelling approximate repeated or common motifs using a suffix tree. In Lucchesi, C.L. and Moura, A.V. (eds), LATIN '98: Theoretical Informatics, Third Latin American Symposium, Vol. 1380 of Lecture Notes in Computer Science, Springer, Berlin, Germany, pp. 374-390.
16. Simpson, J.T. et al. (2009) Abyss: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
17. Tarjan, R. (1983) Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, USA.
18. Trapnell, C. et al. (2009) Tophat: discovering splice junctions with rna-seq. Bioinformatics, 25, 1105-1111.
19. Uno, T. (2008) An efficient algorithm for finding similar short substrings from large scale string data. Proceedings of the 12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD'08), Vol. 5012 of Lecture Notes in Computer Science, Springer, Berlin, Germany, pp. 345-356.
20. Warren, R.L. et al. (2007) Assembling millions of short dna sequences using ssake. Bioinformatics, 23, 500-501.
21. Weese, D. et al. (2009) Razers-fast read mapping with sensitivity control. Genome Res., 19, 1646-1654.
22. Zerbino, D.R. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res., 18, 821-829.