Table of Contents
Algorithms, Volume 12, Issue 3 (March 2019)
- Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
- You may sign up for e-mail alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Cover Story (view full-size image) Large-scale phylogenetic trees—trees depicting the evolutionary history of thousands of species—are [...] Read more. Large-scale phylogenetic trees—trees depicting the evolutionary history of thousands of species—are often constructed by synthesizing the information in collections of smaller input trees. A basic question here is determining whether the input trees are compatible; i.e., whether the evolutionary relationships they represent are mutually consistent. Compatibility testing relies heavily on data structures for maintaining the connected components of a graph under a series of node and edge deletions. The best-known such data structure, HDT, offers polylogarithmic update time, but incurs considerable overhead because of its complexity. We show that in practice, a much simpler data structure performs better than HDT for compatibility testing, as well as for the closely related incomplete directed perfect phylogeny problem. We present theoretical and empirical justifications for our results. View this paper.