High-performance algorithm engineering for computational phylogenetics

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

Volumn 2074, Issue , 2001, Pages 1012-1021

  Moret, Bernard M E ^a   Bader, David A ^a   Warnow, Tandy ^b  

^a University of New Mexico   (United States)

^b UNIVERSITY OF TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044528420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45718-6_107     Document Type: Conference Paper

References (33)

1. Arge, L., Chase, J., Vitter, J.S., & Wickremesinghe, R., "Efficient sorting using registers and caches," Proc. 4th Workshop Alg. Eng. WAE 2000, to appear in LNCS series, Springer Verlag (2000).
2. Bader, D.A., & Moret, B.M.E., "GRAPPA runs in record time," HPC Wire, 9, 47 (Nov. 23), 2000.
3. Bader, D.A., Moret, B.M.E., & Yan, M., "A fast linear-time algorithm for inversion distance with an experimental comparison," Dept. of Comput. Sci. TR 2000-42, U. of New Mexico.
4. Blanchette, M., Bourque, G., & Sankoff, D., "Breakpoint phylogenies," in Genome Informatics 1997, Miyano, S., & Takagi, T., eds., Univ. Academy Press, Tokyo, 25-34.
5. Bender, M.A., Demaine, E., and Farach-Colton, M., "Cache-oblivious search trees," Proc. 41st Ann. IEEE Symp. Foundations Comput. Sci. FOCS-00, IEEE Press (2000), 399-409.
6. Cherkassky, B.V., Goldberg, A.V., & Radzik, T., "Shortest paths algorithms: theory and experimental evaluation," Math. Progr. 73 (1996), 129-174.
7. Cherkassky, B.V., & Goldberg, A.V., "On implementing the push-relabel method for the maximum flow problem," Algorithmica 19 (1997), 390-410.
8. Cherkassky, B.V., Goldberg, A.V., Martin, P, Setubal, J.C., & Stolfi, J., "Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms," ACM J. Exp. Algorithmics 3, 8 (1998), www.jea.acm.org/1998/CherkasskyAugment/.
9. Cosner, M.E., Jansen, R.K., Moret, B.M.E., Raubeson, L.A., Wang, L.-S., Warnow, T., & Wyman, S., "A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data," Proc. 8th Int'l Conf. Intelligent Systems Mol. Biol. ISMB-2000, San Diego (2000).
10. Cosner, M.E., Jansen, R.K., Moret, B.M.E., Raubeson, L.A., Wang, L.S., Warnow, T., & Wyman, S., "An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae," Proc. Gene Order Dynamics, Comparative Maps, and Multigene Families DCAF-2000, Montreal (2000).
11. Eiron, N., Rodeh, M., & Stewarts, I., "Matrix multiplication: a case study of enhanced data cache utilization," ACM J. Exp. Algorithmics 4, 3 (1999), www.jea.acm.org/1999/EironMatrix/.
12. Frigo, M., Leiserson, C.E., Prokop, H., & Ramachandran, S., "Cache-oblivious algorithms," Proc. 40th Ann. Symp. Foundations Comput. Sci. FOCS-99, IEEE Press (1999), 285-297.
13. Goldberg, A.V., & Tsioutsiouliklis, K., "Cut tree algorthms: an experimental study," J. Algs. 38, 1 (2001), 51-83.
14. Johnson, D.S., & McGeoch, L.A., "The traveling salesman problem: a case study," in Local Search in Combinatorial Optimization, E. Aarts & J.K. Lenstra, eds., John Wiley, New York (1997), 215-310.
15. Jones, D.W., "An empirical comparison of priority queues and event-set implementations," Commun. ACM 29 (1986), 300-311.
16. Ladner, R., Fix, J.D., & LaMarca, A., "The cache performance of traversals and random accesses," Proc. 10th ACM/SIAM Symp. Discrete Algs. SODA99, SIAM Press (1999), 613-622.
17. LaMarca, A., & Ladner, R., "The influence of caches on the performance of heaps," ACM J. Exp. Algorithmics 1, 4 (1996), www.jea.acm.org/1996/LaMarcaInfluence.
18. LaMarca, A., & Ladner, R., "The influence of caches on the performance of sorting," Proc. 8th ACM/SIAM Symp. Discrete Algs. SODA97, SIAM Press (1997), 370-379.
19. Melhorn, K., & Näher, S. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge U. Press, 1999.
20. Moret, B.M.E., "Towards a discipline of experimental algorithmics," Proc. 5th DIMACS Challenge (to appear), available at www.cs.unm.edu/_moret/dimacs.ps.
21. Moret, B.M.E., & Shapiro, H.D. Algorithms from P to NP, Vol. I: Design and Efficiency. Benjamin-Cummings, Menlo Park, CA, 1991.
22. Moret, B.M.E., & Shapiro, H.D., "An empirical assessment of algorithms for constructing a minimal spanning tree," in Computational Support for Discrete Mathematics, N. Dean & G. Shannon, eds., DIMACS Monographs in Discrete Math. & Theor. Comput. Sci. 15 (1994), 99-117.
23. Moret, B.M.E., Wyman, S., Bader, D.A., Warnow, T., & Yan, M., "A detailed study of breakpoint analysis," Proc. 6th Pacific Symp. Biocomputing PSB 2001, Hawaii, World Scientific Pub. (2001), 583-594.
24. Olmstead, R.G., & Palmer, J.D., "Chloroplast DNA systematics: a review of methods and data analysis," Amer. J. Bot. 81 (1994), 1205-1224.
25. Palmer, J.D., "Chloroplast and mitochondrial genome evolution in land plants," in Cell Organelles, Herrmann, R., ed., Springer Verlag (1992), 99-133.
26. Pe'er, I., & Shamir, R., "The median problems for breakpoints are NP-complete," Elec. Colloq. Comput. Complexity, Report 71, 1998.
27. Rahman, N., & Raman, R., "Analysing cache effects in distribution sorting," Proc. 3rd Workshop Alg. Eng. WAE99, in LNCS 1668, Springer Verlag (1999), 183-197.
28. Raubeson, L.A., & Jansen, R.K., "Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants," Science 255 (1992), 1697-1699.
29. Sanders, P., "Fast priority queues for cached memory," ACM J. Exp. Algorithmics 5, 7 (2000), www.jea.acm.org/2000/SandersPriority/.
30. Sankoff, D., & Blanchette, M., "Multiple genome rearrangement and breakpoint phylogeny," J. Comput. Biol. 5 (1998), 555-570.
31. Saitou, N., & Nei, M., "The neighbor-joining method: A new method for reconstructing phylogenetic trees," Mol. Biol. & Evol. 4 (1987), 406-425.
32. Stasko, J.T., & Vitter, J.S., "Pairing heaps: experiments and analysis," Commun. ACM 30 (1987), 234-249.
33. Xiao, L., Zhang, X., & Kubricht, S.A., "Improving memory performance of sorting algorithms," ACM J. Exp. Algorithmics 5, 3 (2000), www.jea.acm.org/2000/XiaoMemory/.