Combinatorial pattern matching algorithms in computational biology using Perl and R

Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R

Volumn , Issue , 2009, Pages 1-353

  Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80052667450     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420069747     Document Type: Book

References (214)

1. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. The enhanced suffix array and its applications to genome analysis. In Proc. 2nd International Workshop on Algorithms in Bioinformatics, volume 2452 of Lecture Notes in Bioinformatics, pages 449–463. Springer, 2002.
2. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch. Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms, 2(1):53–86, 2004.
3. R. Ahlswede, B. Balkenhol, C. Deppe, and M. Fröhlich. A fast suffix-sorting algorithm. In General Theory of Information Transfer and Combinatorics, volume 4123 of Lecture Notes in Computer Science, pages 719–734. Springer, 2006.
4. B. L. Allen and M. A. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5(1):1–13, 2001.
5. U. Alon. An Introduction to Systems Biology: Design Principles of Biological Circuits. Chapman and Hall/CRC, 2006.
6. S. F. Altschul. Amino acid substitution matrices from an information theoretic perspective. Journal of Molecular Biology, 219(3):555–565, 1991.
7. 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):403–410, 1990.
8. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing, 26(6):1656–1669, 1997.
9. A. Amir and G. M. Landau, editors. Proc. 12th Annual Symp. Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science. Springer, 2001.
10. A. Apostolico and Z. Galil, editors. Combinatorial Algorithms on Words, volume 12 of NATO Advanced Science Institutes Series F, Computer and Systems Sciences. Springer, 1985.
11. A. Apostolico and R. Giancarlo. Sequence alignment in molecular biology. Journal of Computational Biology, 5(2):173–196, 1998.
12. A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2(1–4):316–336, 1987.
13. A. Apostolico and C. Guerra, editors. Proc. 8th Annual Symp. Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science. Springer, 1997.
14. A. Apostolico and C. Guerra, editors. Proc. 13th Annual Symp. Combinatorial Pattern Matching, volume 2373 of Lecture Notes in Computer Science. Springer, 2002
15. A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors. Proc. 3rd Annual Symp. Combinatorial Pattern Matching, volume 644 of Lecture Notes in Computer Science. Springer, 1992.
16. A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors. Proc. 4th Annual Symp. Combinatorial Pattern Matching, volume 684 of Lecture Notes in Computer Science. Springer, 1993.
17. A. Apostolico, M. Crochemore, and K. Park, editors. Proc. 16th Annual Symp. Combinatorial Pattern Matching, volume 3537 of Lecture Notes in Computer Science. Springer, 2005.
18. M. Arenas, G. Valiente, and D. Posada. Characterization of phylogenetic reticulate networks based on the coalescent with recombination. Molecular Biology and Evolution, 25(12):2517– 2520, 2008.
19. R. A. Baeza-Yates, E. Chávez, and M. Crochemore, editors. Proc. 14th Annual Symp. Combinatorial Pattern Matching, volume 2676 of Lecture Notes in Computer Science. Springer, 2003.
20. H.-J. Bandelt and A. Dress. Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics, 7(3):309–343, 1986.
21. M. Baroni, C. Semple, and M. Steel. Hybrids in real time. Systematic Biology, 55(1):46–56, 2006.
22. R. A. Becker, J. M. Chambers, and A. R. Wilks. The New S Language: A Programming Environment for Data Analysis and Graphics. Wadsworth and Brooks/Cole, 1988.
23. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In Proc. 4th Latin American Symp. Theoretical Informatics, volume 1776 of Lecture Notes in Computer Science, pages 88–94. Springer, 2000.
24. M. A. Bender, M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57(2):75–94, 2005.
25. D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, and D. L. Wheeler. GenBank. Nucleic Acids Research, 36(D):25–30, 2008.
26. E. Birney, S. Markel, and J. E. Stajich. Using BioPerl. Cambridge University Press, 2009. In press.
27. F. R. Blattner, G. Plunkett, C. A. Bloch, N. T. Perna, V. Burland, M. Riley, J. Collado-Vides, J. D. Glasner, C. K. Rode, G. F. Mayhew, J. Gregor, N. W. Davis, H. A. Kirkpatrick, M. A. Goeden, D. J. Rose, B. Mau, and Y. Shao. The complete genome sequence of Escherichia coli K-12. Science, 277(5331):1453–1462, 1997.
28. J. Bluis and D.-G. Shin. Nodal distance algorithm: Calculating a phylogenetic tree comparison metric. In Proc. 3rd IEEE Symp. BioInformatics and BioEngineering, pages 87–94. IEEE Press, 2003.
29. G. S. Brodal, R. Fagerberg, and C. N. S. Pedersen. Computing the quartet distance between evolutionary trees in time O(nlogn). Algorithmica, 38:377–395, 2003.
30. D. Bryant, J. Tsang, P. Kearney, and M. Li. Computing the quartet distance between evolutionary trees. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 285–286. ACM/SIAM, 2000.
31. H. Bunke and J. Csirik. Parametric string edit distance and its application to pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, 25(1):202–206, 1995.
32. F. Burkhardt and S. Smith, editors. The Correspondence of Charles Darwin, volume 2, 1837– 1843 of The Correspondence of Charles Darwin. Cambridge University Press, 1987.
33. G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente. A distance metric for a class of tree-sibling phylogenetic networks. Bioinformatics, 24(13):1481–1488, 2008a.
34. G. Cardona, F. Rosselló, and G. Valiente. A Perl package and an alignment tool for phylogenetic networks. BMC Bioinformatics, 9:175, 2008b.
35. G. Cardona, F. Rosselló, and G. Valiente. Extended Newick: It is time for a standard representation of phylogenetic networks. BMC Bioinformatics, 9:532, 2008c.
36. G. Cardona, F. Rosselló, and G. Valiente. Tripartitions do not always discriminate phylogenetic networks. Mathematical Biosciences, 211(2):356–370, 2008d.
37. G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente. Metrics for phylogenetic networks I: Generalizations of the Robinson-Foulds metric. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(1):46–61, 2009a.
38. G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente. Metrics for phylogenetic networks II: Nodal and triplets metrics. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2009b. In press.
39. G. Cardona, F. Rosselló, and G. Valiente. Comparison of tree-child phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2009c. In press.
40. L. L. Cavalli-Sforza and A. W. F. Edwards. Phylogenetic analysis: Models and estimation procedures. American Journal of Human Genetics, 19(3):233–257, 1967.
41. A. Cayley. On the theory of the analytical forms called trees. Philosophical Magazine, 13:19–30, 1857.
42. A. Cayley. On the analytical forms called trees. American Journal of Mathematics, 4(1):266–268, 1881.
43. J. M. Chambers. Programming with Data: A Guide to the S Language. Springer, 1998.
44. J. M. Chambers. Software for Data Analysis: Programming with R. Springer, 2008.
45. D. Charif 1.0-2: A contributed package to the R project for statistical computing devoted to biological sequences retrieval and analysis. In U. Bastolla, M. Porto, H. E. Roman, and M. Vendruscolo, editors, Structural Approaches to Sequence Evolution: Molecules, Networks, Populations, Biological and Medical Physics, Biomedical Engineering, pages 207–232. Springer, 2007.
46. C. Choy, J. Jansson, K. Sadakane, and W.-K. Sung. Computing the maximum agreement of phylogenetic networks. Theoretical Computer Science, 335(1):93–107, 2005.
47. C. Christiansen, T. Mailund, C. N. S. Pedersen, M. Randers, and M. S. Stissing. Fast calculation of the quartet distance between trees of arbitrary degrees. Algorithms for Molecular Biology, 1:16, 2006.
48. T. Christiansen and N. Torkington. Perl Cookbook. O’Reilly, 2nd edition, 2003.
49. J. Cohen. Bioinformatics: An introduction for computer scientists. ACM Computing Surveys, 36(2):122–158, 2004.
50. R. Cole, M. Farach-Colton, R. Hariharan, T. M. Przytycka, and M. Thorup. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing, 30(5):1385–1404, 2000.
51. S. Cozens. Advanced Perl Programming. O’Reilly, 2nd edition, 2005.
52. D. E. Critchlow, D. K. Pearl, and C. Qian. The triples distance for rooted bifurcating phylogenetic trees. Systematic Biology, 45(3):323–334, 1996.
53. M. Crochemore and D. Gusfield, editors. Proc. 5th Annual Symp. Combinatorial Pattern Matching, volume 807 of Lecture Notes in Computer Science. Springer, 1994.
54. M. Crochemore and M. Paterson, editors. Proc. 10th Annual Symp. Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science. Springer, 1999.
55. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
56. M. Crochemore and W. Rytter. Jewels of Stringology. World Scientific, 2003.
57. M. Crochemore, C. Hancart, and T. Lecroq. Algorithms on Strings. Cambridge University Press, 2007.
58. G. Csárdi and T. Nepusz. The igraph software package for complex network research. InterJournal Complex Systems, 1695, 2006.
59. B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang. On distances between phylogenetic trees. In Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 427–436. ACM/SIAM, 1997.
60. W. H. E. Day. Optimal algorithms for comparing trees with labeled leaves. J. Classification, 2 (1):7–28, 1985.
61. M. O. Dayhoff, R. Schwartz, and B. C. Orcutt. A model of evolutionary change in proteins. In M. O. Dayhoff, editor, Atlas of Protein Sequence and Structure, volume 5, supplement 3, pages 345–358. National Biomedical Research Foundation, Washington, DC, 1978.
62. R. C. Deonier, S. Tavaré, and M. S. Waterman. Computational Genome Analysis: An Introduction. Springer, 2005.
63. Y. Deville, D. Gilbert, J. van Helden, and S. J. Wodak. An overview of data models for the analysis of biochemical pathways. Briefings in Bioinformatics, 4(3):246–259, 2003.
64. M.-M. Deza and E. Deza. Dictionary of Distances. Elsevier Science, 2006.
65. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.
66. R. A. Dwyer. Genomic Perl: From Bioinformatics Basics to Working Code. Cambridge University Press, 2003.
67. S. R. Eddy. Where did the BLOSUM62 alignment score matrix come from? Nature Biotechnology, 22(8):1035–1036, 2004a.
68. S. R. Eddy. What is dynamic programming? Nature Biotechnology, 22(7):909–910, 2004b.
69. G. Estabrook, F. R. McMorris, and C. Meacham. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Systematic Zoology, 34(2):193–200, 1985.
70. P. A. Evans. Finding common subsequences with arcs and pseudoknots. In Proc. 10th Annual Symp. Combinatorial Pattern Matching, volume 1645 of Lecture Notes in Computer Science, pages 270–280. Springer, 1999.
71. M. Farach. Optimal suffix tree construction with large alphabets. In Proc. 38th Annual Symposium on Foundations of Computer Science, pages 137–143. IEEE Computer Science Press, 1997.
72. M. Farach-Colton, editor. Proc. 9th Annual Symp. Combinatorial Pattern Matching, volume 1448 of Lecture Notes in Computer Science. Springer, 1998.
73. J. Felsenstein. Evolutionary trees from DNA sequences: A maximum likelihood approach. Journal of Molecular Evolution, 17(6):368–376, 1981.
74. J. Felsenstein. Inferring Phylogenies. Sinauer Associates, 2004.
75. P. Ferragina and G. M. Landau, editors. Proc. 19th Annual Symp. Combinatorial Pattern Matching, volume 5029 of Lecture Notes in Computer Science. Springer, 2008.
76. P. Ferragina, R. Giancarlo, V. Greco, G. Manzini, and G. Valiente. Compression-based classification of biological sequences and structures via the Universal Similarity Metric: Experimental assessment. BMC Bioinformatics, 8:252, 2007.
77. A. Firth, T. Bell, A. Mukherjee, and D. Adjeroh. A comparison of BWT approaches to string pattern matching. Software Practice and Experience, 35(13):1217–1258, 2005.
78. B. D. Foy. Mastering Perl. O’Reilly, 2007.
79. Z. Galil and E. Ukkonen, editors. Proc. 6th Annual Symp. Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science. Springer, 1995.
80. G. Gati. Further annotated bibliography on the isomorphism disease. Journal of Graph Theory, 3(2):95–109, 1979.
81. R. Gentleman. R Programming for Bioinformatics, volume 12 of Chapman and Hall/CRC Computer Science and Data Analysis. Chapman and Hall/CRC, 2008.
82. R. Gentleman, V. Carey, W. Huber, R. Irizarry, and S. Dudoit, editors. Bioinformatics and Computational Biology Solutions Using R and Bioconductor. Springer, 2005.
83. R. Giancarlo and D. Sankoff, editors. Proc. 11th Annual Symp. Combinatorial Pattern Matching, volume 1848 of Lecture Notes in Computer Science. Springer, 2000.
84. R. Giegerich. A systematic approach to dynamic programming in bioinformatics. Bioinformatics, 16(8):665–677, 2000.
85. R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 19(3):331–353, 1997.
86. W. Goddard, E. Kubicka, G. Kubicki, and F. R. McMorris. The agreement metric for labeled binary trees. Mathematical Biosciences, 123(2):215–226, 1994.
87. G. H. Gonnet, R. A. Baeza-Yates, and T. Snider. New indices for text: PAT trees and PAT arrays. In W. B. Frakes and R. A. Baeza-Yates, editors, Information Retrieval: Data Structures and Algorithms, pages 66–82. Prentice-Hall, 1992.
88. O. Gotoh. An improved algorithm for matching biological sequences. Journal of Molecular Biology, 162(3):705–708, 1982.
89. O. Gotoh. Multiple sequence alignment: Algorithms and applications. Advances in Biophysics, 36(1):159–206, 1999.
90. R. E. Green, A.-S. Malaspinas, J. Krause, A. W. Briggs, P. L. F. Johnson, C. Uhler, M. Meyer, J. M. Good, T. Maricic, U. Stenzel, K. Prüfer, M. Siebauer, H. A. Burbano, M. Ronan, J. M. Rothberg, M. Egholm, P. Rudan, D. Brajković, Željko Kućan, I. Gušić, M. Wikström, L. Laakkonen, J. Kelso, M. Slatkin, and S. Pääbo. A complete Neandertal mitochondrial genome sequence determined by high-throughput sequencing. Cell, 134(3):416–426, 2008.
91. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing, 35(2):378–407, 2005.
92. D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
93. D. Gusfield, K. Balasubramanian, and D. Naor. Parametric optimization of sequence alignment. Algorithmica, 12(4/5):312–326, 1994.
94. D. Gusfield, S. Eddhu, and C. Langley. The fine structure of galls in phylogenetic networks. INFORMS Journal on Computing, 16(4):459–469, 2004a.
95. D. Gusfield, S. Eddhu, and C. Langley. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology, 2 (1):173–213, 2004b.
96. O. Haddrath and A. J. Baker. Complete mitochondrial DNA genome sequences of extinct birds: Ratite phylogenetics and the vicariance biogeography hypothesis. Proc. Royal Society B: Biological Sciences, 268(1470):939–945, 2001.
97. F. Hahne, W. Huber, R. Gentleman, and S. Falcon. Bioconductor Case Studies. Springer, 2008.
98. R. W. Hamming. Error detecting and error correcting codes. The Bell System Technical Journal, 26(2):147–160, 1950.
99. Y.-J. He, T. N. D. Huynh, J. Jansson, and W.-K. Sung. Inferring phylogenetic relationships avoiding forbidden rooted triplets. Journal of Bioinformatics and Computational Biology, 4 (1):59–74, 2006.
100. J. Hein. Reconstructing the history of sequences subject to gene conversion and recombination. Mathematical Biosciences, 98(2):185–200, 1990.
101. J. Hein. A heuristic method to reconstruct the history of sequences subject to recombination. Journal of Molecular Evolution, 36(4):396–405, 1993.
102. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71(1–3):153–169, 1996.
103. S. Henikoff and J. G. Henikoff. Amino acid substitution matrices from protein blocks. Proc. National Academy of Sciences USA, 89(22):10915–10919, 1992.
104. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the ACM, 18(6):341–343, 1975.
105. D. S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the ACM, 24(4):664–675, 1977.
106. D. S. Hirschberg and E. W. Myers, editors. Proc. 7th Annual Symp. Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science. Springer, 1996.
107. W.-K. Hon, T. W. Lam, K. Sadakane, W.-K. Sung, and S.-M. Yiu. A space and time efficient algorithm for constructing compressed suffix arrays. Algorithmica, 48(1):23–36, 2007.
108. D. C. Jamison. Perl Programming for Biologists. John Wiley and Sons, 2003.
109. J. Jansson and W.-K. Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theoretical Computer Science, 363(1):60–68, 2006.
110. J. Jansson and W.-K. Sung. The maximum agreement of two nested phylogenetic networks. In O. N. Terikhovsky and W. N. Burton, editors, New Topics in Theoretical Computer Science, chapter 4, pages 119–141. Nova Science Publishers, Hauppauge, New York, 2008.
111. J. Jansson, N. B. Nguyen, and W.-K. Sung. Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM Journal on Computing, 35(5):1098–1121, 2006.
112. N. C. Jones and P. A. Pevzner. An Introduction to Bioinformatics Algorithms. MIT Press, 2004.
113. T. H. Jukes and C. R. Cantor. Evolution of protein molecules. In H. N. Munro, editor, Mammalian Protein Metabolism, volume 3, pages 21–123. Academic Press, New York, 1969.
114. J. Kärkkäinen, P. Sanders, and S. Burkhardt. Linear work suffix array construction. Journal of the ACM, 53(6):918–936, 2006.
115. M. Kasahara and S. Morishita. Large-Scale Genome Sequence Processing. World Scientific, 2006.
116. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proc. 12th Annual Symp. Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 181–192. Springer, 2001.
117. D. K. Kim, J. S. Sim, H. Park, and K. Park. Constructing suffix arrays in linear time. Journal of Discrete Algorithms, 3(2–4):126–142, 2005.
118. M. Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. Journal of Molecular Evolution, 16(2):111–120, 1980.
119. H. Kitano. Computational systems biology. Nature, 420(6912):206–210, 2002a.
120. H. Kitano. Systems biology: A brief overview. Science, 295(5560):1662–1664, 2002b.
121. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, 3(2–4):143–156, 2005.
122. J. Koolman and K.-H. Roehm. Color Atlas of Biochemistry. Georg Thieme Verlag, 2nd edition, 2005.
123. M. Kreitman. Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster. Nature, 304(5925):412–417, 1983.
124. M. Křivánek. Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete. Journal of Classification, 3(1):55–60, 1986.
125. S.-Y. Le, R. Nussinov, and J. V. Maizel. Tree graphs of RNA secondary structures and their comparisons. Computers and Biomedical Research, 22(5):461–473, 1989.
126. M. D. LeBlanc and B. D. Dyer. Perl for Exploring DNA. Oxford University Press, 2007.
127. C.-M. Lee, L.-J. Hung, M.-S. Chang, C.-B. Shen, and C.-Y. Tang. An improved algorithm for the maximum agreement subtree problem. Information Processing Letters, 94(5):211–216, 2005.
128. C. Y. Lee. An algorithm for path connection and its applications. IRE Trans. Electronic Computers, 10(3):346–365, 1961.
129. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Doklady Physics, 10(8):707–710, 1966.
130. M. Levitt and S. Lifson. Refinement of protein conformations using a macromolecular energy minimization procedure. Journal of Molecular Biology, 46(2):269–279, 1969.
131. M. Lewenstein and G. Valiente, editors. Proc. 17th Annual Symp. Combinatorial Pattern Matching, volume 4009 of Lecture Notes in Computer Science. Springer, 2006.
132. R. B. Lyngsø, Y. S. Song, and J. Hein. Minimum recombination histories by branch and bound. In Proc. 5th International Workshop on Algorithms in Bioinformatics, volume 3692 of Lecture Notes in Bioinformatics, pages 239–250. Springer, 2005.
133. B. Ma and K. Zhang, editors. Proc. 18th Annual Symp. Combinatorial Pattern Matching, volume 4580 of Lecture Notes in Computer Science. Springer, 2007.
134. W. P. Maddison. Gene trees in species trees. Systematic Biology, 46(3):523–536, 1997.
135. T. Mailund, G. S. Brodal, R. Fagerberg, C. N. S. Pedersen, and D. Phillips. Recrafting the neighbor-joining method. BMC Bioinformatics, 7:29, 2006.
136. J. Maindonald and J. Braun. Data Analysis and Graphics Using R: An Example-based Approach. Cambridge University Press, 2nd edition, 2008.
137. V. Mäkinen. Compact suffix array: A space-efficient full-text index. Fundamenta Infomaticae, 56(1–2):191–210, 2003.
138. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935–948, 1993.
139. M. A. Maniscalco and S. J. Puglisi. An efficient, versatile approach to suffix sorting. Journal of Experimental Algorithmics, 12(1):1.2, 2008.
140. G. Manzini. Two space saving tricks for linear time LCP array computation. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 372–383. Springer, 2004.
141. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262–272, 1976.
142. E. F. Moore. The shortest path through a maze. In Proc. Int. Symp. Theory of Switching, pages 285–292. Harvard University Press, 1959.
143. G. W. Moore, M. Goodman, and J. Barnabas. An iterative approach from the standpoint of the additive hypothesis to the dendogram problem posed by molecular data sets. Journal of Theoretical Biology, 38(3):423–457, 1973.
144. B. M. E. Moret, L. Nakhleh, T. Warnow, C. R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme. Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1):13–23, 2004.
145. M. M. Morin and B. M. E. Moret. NETGEN: Generating phylogenetic networks with diploid hybrids. Bioinformatics, 22(15):1921–1923, 2006.
146. P. Murrell. R Graphics, volume 6 of Computer Science and Data Analysis. Chapman and Hall/CRC, 2005.
147. E. W. Myers and W. Miller. Optimal alignments in linear space. Computer Applications in the Biosciences, 4(1):11–17, 1988.
148. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1): 31–88, 2001.
149. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings. Cambridge University Press, 2002.
150. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3):443–453, 1970.
151. D. L. Nelson and M. M. Cox. Lehninger Principles of Biochemistry. W. H. Freeman, 5th edition, 2008.
152. C. Notredame. Recent evolutions of multiple sequence alignment algorithms. PLOS Computational Biology, 3(8):1405–1408, 2007.
153. B. Ø. Palsson. Systems Biology: Properties of Reconstructed Networks. Cambridge University Press, 2006.
154. G. Pandey, V. Kumar, and M. Steinbach. Computational Approaches for Protein Function Prediction. Wiley Series on Bioinformatics: Computational Techniques and Engineering. Wiley, 2008.
155. E. Paradis. Analysis of Phylogenetics and Evolution with R. Springer, 2006.
156. J. R. Parrish, J. Yu, G. Liu, J. A. Hines, J. E. Chan, B. A. Mangiola, H. Zhang, S. Pacifico, F. Fotouhi, V. J. DiRita, T. Ideker, P. Andrews, and R. L. Finley, Jr. A proteome-wide protein interaction map for Campylobacter jejuni. Genome Biology, 8(7):R130.1–R130.19, 2007.
157. N. D. Pattengale, E. J. Gottlieb, and B. M. Moret. Efficiently computing the Robinson-Foulds metric. Journal of Computational Biology, 14(6):724–735, 2007.
158. W. R. Pearson and D. J. Lipman. Improved tools for biological sequence comparison. Proc. National Academy of Sciences USA, 85(8):2444–2448, 1988.
159. D. Penny and M. D. Hendy. The use of tree comparison metrics. Systematic Zoology, 34(1): 75–82, 1985.
160. P. A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000.
161. S. S. Rao. Time-space trade-offs for compressed suffix arrays. Information Processing Letters, 82(6):307–311, 2002.
162. R. C. Read and D. G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1(4): 339–363, 1977.
163. F. Restle. A metric and an ordering on sets. Psychometrika, 24(3):207–220, 1959.
164. D. F. Robinson and L. R. Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53(1/2):131–147, 1981.
165. D. F. Robinson and L. R. Foulds. Comparison of labeled trees with valency three. Journal of Combinatorial Theory, 11:105–119, 1971.
166. A. Rzhetsky and M. Nei. A simple method for estimating and testing minimum-evolution trees. Molecular Biology and Evolution, 9(5):945–967, 1992.
167. S. C. Sahinalp, S. Muthukrishnan, and U. Dogrusüz, editors. Proc. 15th Annual Symp. Combinatorial Pattern Matching, volume 3109 of Lecture Notes in Computer Science. Springer, 2004.
168. N. Saitou and M. Nei. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4(4):406–425, 1987.
169. F. Sanger and M. Dowding, editors. Selected Papers of Frederick Sanger. World Scientific, 1996.
170. F. Sanger, S. Nicklen, and A. R. Coulson. DNA sequencing with chain-terminating inhibitors. Proc. National Academy of Sciences USA, 74(12):5463–5467, 1977.
171. W. R. Schmitt and M. S. Waterman. Linear trees and RNA secondary structure. Discrete Applied Mathematics, 51(3):317–323, 1994.
172. K.-B. Schürmann and J. Stoye. An incomplex algorithm for fast suffix array construction. Software Practice and Experience, 37(3):309–329, 2007.
173. R. L. Schwartz, B. D. Foy, and T. Phoenix. Intermediate Perl. O’Reilly, 2006.
174. R. L. Schwartz, T. Phoenix, and B. D. Foy. Learning Perl. O’Reilly, 5th edition, 2008.
175. C. Semple and M. Steel. Unicyclic networks: Compatibility and enumeration. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(1):84–91, 2006.
176. B. A. Shapiro. An algorithm for comparing multiple RNA secondary structures. Computer Applications in the Biosciences, 4(3):387–393, 1988.
177. B. A. Shapiro and K. Zhang. Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences, 6(4):309–318, 1990.
178. F. Shi. Suffix arrays for multiple strings: A method for on-line multiple string searches. In Proc. 2nd Asian Computing Science Conf. Concurrency and Parallelism, Programming, Networking, and Security, volume 1179 of Lecture Notes in Computer Science, pages 11–22. Springer, 1996.
179. P. W. Shor. A new proof of Cayley’s formula for counting labeled trees. Journal of Combinatorial Theory Series A, 71(1):154–158, 1995.
180. D. Siegmund and B. Yakir. The Statistics of Gene Mapping. Springer, 2007.
181. N. J. A. Sloane and S. Plouffe. The Encyclopedia of Integer Sequences. Academic Press, 1995.
182. T. F. Smith and M. S. Waterman. How alike are two trees? American Mathematical Monthly, 87(7):552–553, 1980.
183. T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147(1):195–197, 1981.
184. B. Smyth. Computing Patterns in Strings. Addison-Wesley, 2003.
185. P. H. A. Sneath and R. R. Sokal, editors. Numerical Taxonomy: The Principles and Practice of Numerical Classification. W. H. Freeman, 1973.
186. P. Spector. Data Manipulation with R. Springer, 2008.
187. J. E. Stajich, D. Block, K. Boulez, S. E. Brenner, S. A. Chervitz, C. Dagdigian, G. Fuellen, J. G. Gilbert, I. Korf, H. Lapp, H. Lehvaslaiho, C. Matsalla, C. J. Mungall, B. I. Osborne, M. R. Pocock, P. Schattner, M. Senger, L. D. Stein, E. Stupka, M. D. Wilkinson, and E. Birney. The BioPerl toolkit: Perl modules for the life sciences. Genome Research, 12(10):1611–1618, 2002. URL http://www.bioperl.org.
188. M. A. Steel and D. Penny. Distributions of tree comparison metrics: Some new results. Systematic Biology, 42(2):126–141, 1993.
189. M. A. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48(2):77–82, 1993.
190. L. D. Stein. How Perl saved the Human Genome Project. The Perl Journal, 1(2), 1996.
191. G. A. Stephen. String Searching Algorithms. World Scientific, 1998.
192. K. Strimmer and V. Moulton. Likelihood analysis of phylogenetic networks using directed graphical models. Molecular Biology and Evolution, 17(6):875–881, 2000.
193. K. Strimmer, C. Wiuf, and V. Moulton. Recombination analysis using directed graphical models. Molecular Biology and Evolution, 18(1):97–99, 2001.
194. J. A. Studier and K. J. Keppler. A note on the neighbor-joining algorithm of Saitou and Nei. Molecular Biology and Evolution, 5(6):729–731, 1988.
195. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1 (2):146–160, 1972.
196. J. Tisdall. Beginning Perl for Bioinformatics. O’Reilly, 2001.
197. J. Tisdall. Mastering Perl for Bioinformatics. O’Reilly, 2003.
198. S. Tregar. Writing Perl Modules for CPAN. Apress, 2002.
199. E. Ukkonen. Constructing suffix trees on-line in linear time. In J. van Leeuwen, editor, Proc. IFIP 12th World Computer Congress, pages 484–492. Elsevier, 1992.
200. G. Valiente. Algorithms on Trees and Graphs. Springer, 2002.
201. G. Valiente. A fast algorithmic technique for comparing large phylogenetic trees. In Proc. 12th Int. Symp. String Processing and Information Retrieval, volume 3772 of Lecture Notes in Computer Science, pages 371–376. Springer, 2005.
202. W. N. Venables and B. D. Ripley. S Programming. Springer, 2000.
203. S. Vinga and J. Almeida. Alignment-free sequence comparison: A review. Bioinformatics, 19 (4):513–523, 2003.
204. M. Vingron and M. S. Waterman. Sequence alignment and penalty choice: Review of concepts, case studies and implications. Journal of Molecular Biology, 235(1):1–12, 1994.
205. R. A. Wagner and M. J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168–173, 1974.
206. L. Wall, T. Christiansen, and. Programming Perl. O’Reilly, 3rd edition, 2000.
207. L. Wang, K. Zhang, and L. Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8(1):69–78, 2001.
208. M. S. Waterman. Secondary structure of single-stranded nucleic acids. In G.-C. Rota, editor, Studies in Foundations and Combinatorics, volume 1 of Advances in Mathematics: Supplementary Studies, pages 167–212. Academic Press, 1978.
209. M. S. Waterman. Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman and Hall/CRC, 1995.
210. P. Weiner. Linear pattern matching algorithms. In Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1–11. IEEE Computer Science Press, 1973.
211. D. Weininger. SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules. Journal of Chemical Information and Computer Sciences, 28(1): 31–36, 1988.
212. W. T. Williams and H. T. Clifford. On the comparison of two classifications of the same set of elements. Taxon, 20(4):519–522, 1971.
213. S. M. Woolley, D. Posada, and K. A. Crandall. A comparison of phylogenetic network methods using computer simulation. Plos ONE, 4(3):e1913, 2008.
214. K. A. Zaretskii. Constructing a tree on the basis of a set of distances between the hanging vertices. Uspekhi Matematicheskikh Nauk, 20(6):90–92, 1965.