Fractal MapReduce decomposition of sequence alignment

Algorithms for Molecular Biology

Volumn 7, Issue 1, 2012, Pages

  Almeida, Jonas S ^a   Grüneberg, Alexander ^a,b   Maass, Wolfgang ^b,c   Vinga, Susana ^d,e  

^a University of Alabama at Birmingham   (United States)

^b FURTWANGEN UNIVERSITY   (Germany)

^c SAARLAND UNIVERSITY   (Germany)

^d INESC   (Portugal)

^e UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84860338510     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-7-12     Document Type: Article

References (32)

1. Wetterstrand KA. DNA Sequencing Costs: Data from the NHGRI Large-Scale Genome Sequencing Program. 2011, [cited 2011 September]., http://www.genome.gov/sequencingcosts
2. Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 1970, 48(3):443-53.
3. Smith TF, Waterman MS. Identification of common molecular subsequences. J Mol Biol 1981, 147(1):195-7.
4. Ruffalo M, Laframboise T, Koyuturk M. Comparative analysis of algorithms for next-generation sequencing read alignment. Bioinformatics 2011,
5. Vinga S, Almeida J. Alignment-free sequence comparison-a review. Bioinformatics 2003, 19(4):513-23.
6. Deschavanne P, Tuffery P. Exploring an alignment free approach for protein classification and structural class prediction. Biochimie 2008, 90(4):615-25.
7. Reinert G, et al. Alignment-free sequence comparison (I): statistics and power. J Comput Biol 2009, 16(12):1615-34.
8. Wan L, et al. Alignment-free sequence comparison (II): theoretical power of comparison statistics. J Comput Biol 2010, 17(11):1467-90.
9. Huang G, et al. Alignment-free comparison of genome sequences by a new numerical characterization. J Theor Biol 2011, 281(1):107-12.
10. Dean J, Ghemawat S. Mapreduce: Simplified data processing on large clusters. Communications of the Acm 2008, 51(1):107-113.
11. Schadt EE, et al. Computational solutions to large-scale data management and analysis. Nat Rev Genet 2010, 11(9):647-57.
12. McKenna A, et al. The Genome Analysis Toolkit: a MapReduce framework for analyzing next-generation DNA sequencing data. Genome Res 2010, 20(9):1297-303.
13. Schatz MC. CloudBurst: highly sensitive read mapping with MapReduce. Bioinformatics 2009, 25(11):1363-9.
14. Taylor RC. An overview of the Hadoop/MapReduce/HBase framework and its current applications in bioinformatics. BMC Bioinformatics 2010, 11(Suppl 12):S1.
15. Jeffrey HJ. Chaos game representation of gene structure. Nucleic Acids Res 1990, 18(8):2163-70.
16. Almeida JS, et al. Analysis of genomic sequences by Chaos Game Representation. Bioinformatics 2001, 17(5):429-37.
17. Almeida JS, Vinga S. Universal sequence map (USM) of arbitrary discrete sequences. BMC Bioinformatics 2002, 3:6.
18. Haubold B, Reed FA, Pfaffelhuber P. Alignment-free estimation of nucleotide diversity. Bioinformatics 2011, 27(4):449-55.
19. Almeida JS, Vinga S. Computing distribution of scale independent motifs in biological sequences. Algorithms Mol Biol 2006, 1:18.
20. Almeida JS, Vinga S. Biological sequences as pictures: a generic two dimensional solution for iterated maps. BMC Bioinformatics 2009, 10:100.
21. Joseph J, Sasikumar R. Chaos game representation for comparison of whole genomes. BMC Bioinformatics 2006, 7:243.
22. Schwacke J, Almeida JS. Efficient Boolean implementation of universal sequence maps (bUSM). BMC Bioinformatics 2002, 3:28.
23. Jongboom J. An educational MapReduce framework implemented in Javascript. 2011, , http://code.google.com/p/mapreduce-js/
24. Backus J. Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs. Communications of the ACM 1978, 21(8):613-641.
25. usm.L. , https://github.com/usm/usm.github.com/blob/07a39896293a57ecdeec571335ae782bb56 c2972/usm.js#L184
26. usm.str2cube. , https://github.com/usm/usm.github.com/blob/07a39896293a57ecdeec571335ae782bb56 c2972/usm.js#L53
27. usm.encode.
28. usm.decodeBin.
29. usm.distCGR. , https://github.com/usm/usm.github.com/blob/07a39896293a57ecdeec571335ae782bb56 c2972/usm.js#L190
30. usm.dist.
31. usm.dMap.
32. Crockford D. JavaScript: the good parts: [unearthing the excellence in JavaScript]. 2008, 153. Beijing; Sebastopol, CA: O'Reilly, 1, xiii.