High-performance algorithm engineering for computational phylogenetics

Journal of Supercomputing

Volumn 22, Issue 1, 2002, Pages 99-111

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

^a University of New Mexico   (United States)

^b University of Texas at Austin   (United States)

Author keywords

Breakpoint analysis; Computational genomics; Genome rearrangement; High performance computing; Phylogeny reconstruction; Sorting by reversals

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA REDUCTION; GENETIC ALGORITHMS; GENETIC ENGINEERING; MOLECULAR DYNAMICS; OPTIMIZATION;

COMPUTATIONAL PHYLOGENETICS;

COMPUTATION THEORY;

EID: 0036568578     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014362705613     Document Type: Article

References (46)

1. Efficient sorting using registers and caches
2. GRAPPA runs in record time
3. High-performance algorithm engineering for parallel computation
4. Industrial applications of high-performance computing for phylogeny reconstruction
5. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
6. Cache-oblivious search trees
7. Breakpoint phylogenies
8. On implementing the push-relabel method for the maximum flow problem
9. Augment or push: A computational study of bipartite matching and unit-capacity flow algorithms
10. Shortest paths algorithms: Theory and experimental evaluation
11. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae
12. A new fast heuristic for computing the breakpoint phylogeny and a phylogenetic analysis of a group of highly rearranged chloroplast genomes
13. Matrix multiplication: A case study of enhanced data cache utilization
14. Cache-oblivious algorithms
15. Cut tree algorthms: An experimental study
16. The traveling salesman problem: A case study
17. An empirical comparison of priority queues and event-set implementations
18. The cache performance of traversals and random accesses
19. The influence of caches on the performance of heaps
20. The influence of caches on the performance of heaps
21. High-performance algorithm engineering for computational phylogenetics
22. An empirical assessment of algorithms for constructing a minimal spanning tree
23. Algorithms and experiments: The new (and old) methodology
24. New approaches for reconstructing phylogenies based on gene order
25. Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics
26. A new implementation and detailed study of breakpoint analysis
27. Chloroplast DNA systematics: A review of methods and data analysis
28. Chloroplast and mitochondrial genome evolution in land plants
29. Analysing cache effects in distribution sorting
30. Chloroplast DNA evidence on the ancient evolutionary split in vascular land plants
31. Analyzing large datasets: rbcl500 revisited
32. The neighbor-joining method: A new method for reconstruction of phylogenetic trees
33. Fast priority queues for cached memory
34. Multiple genome rearrangement and breakpoint phylogeny
35. Pairing heaps: Experiments and analysis
36. Neuromedin U is a potent agonist at the orphan G protein-coupled receptor FM3
37. Improving the accuracy of evolutionary distances between genomes
38. Estimating true evolutionary distances between genomes
39. Improving memory performance of sorting algorithms
40. Cloning, expression, and pharmacological characterization of a novel human histamine receptor