BLASTGRAPH: Intensive approximate pattern matching in sequence graphs and de-Bruijn graphs

Proceedings of the Prague Stringology Conference, PSC 2012

Volumn , Issue , 2012, Pages 53-63

  Holley, Guillaume ^a   Peterlongo, Pierre ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

de Bruijn graph; High throughput sequencing; Next generation sequencing; Sequence assembly; Sequence graph; String matching; Viterbi algorithm

Indexed keywords

DE-BRUIJN GRAPH; HIGH THROUGHPUT; NEXT GENERATION SEQUENCING; SEQUENCE GRAPH; STRING MATCHING;

THROUGHPUT; VITERBI ALGORITHM;

PATTERN MATCHING;

EID: 84870501846     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman: Basic local alignment search tool. Journal of Molecular Biology, 215(3) 1990, pp. 403-410.
2. M. J. CHAISSON, D. BRINZA, and P. A. PEVZNER: De novo fragment assembly with short mate-paired reads: Does the read length matter? Genome Research, 19(2) 2009, pp. 336-346.
3. M. J. CHAISSON and P. A. PEVZNER: Short read fragment assembly of bacterial genomes. Genome Research, 18(2) 2008, pp. 324-330.
4. R. CHIKHI and G Rlzk: Space-efficient and exact de Bruijn graph representation based on a Bloom filter, in WABI, 2012, p. to appear.
5. S. FEATURE: Next-generation sequencing transforms today's biology. Most, 5(1) 2008, pp. 16-18.
6. D. E. KNUTH, J. JAMES H. MORRIS, and V. R. PRATT: Fast pattern matching in strings. SIAM Journal on Computing, 6(2) 1977, pp. 323-350.
7. R. Li, H. Zhu, J. Ruan, W. Qian, X. Fang, Z. Shi, Y. Li, S. Li, G. Shan, K. Kristiansen, S. Li, H. YANG, J. WANG, and J. WANG: De novo assembly of human genomes with massively parallel short read sequencing. Genome Research, 20(2) 2010, pp. 265-272.
8. P. Medvedev, K. Georgiou, G. Myers, and M. Brudno: Computability of models for sequence assembly, in WABI, 2007, pp. 289-301.
9. P. A. Pevzner, H. Tang, and M. S. Waterman: An Eulerian path approach to DNA fragment assembly. Proceedings of the National Academy of Sciences of the United States of America, 98(17) Aug. 2001, pp. 9748-53.
10. M. E. Smoot, K. Ono, J. Ruscheinski, P.-L. Wang, and T. Ideker: Cytoscape 2.8: new features for data integration and network visualization. Bioinformatics, 27(3) 2011, pp. 431-432.
11. A VlTERBl: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. Information Theory, IEEE Transactions on, 13(2) april 1967, pp. 260-269.
12. D. R. ZERBINO and E. Birney: Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Research, 18(5) 2008, pp. 821-829