Showing results 8 to 16 of 16
< previous
Title | Author(s) | Issue Date | |
---|---|---|---|
An even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings Journal:Journal of Algorithms | 2001 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | ||
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers Proceeding/Conference:Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science | 2000 | ||
Linear-time haplotype inference on pedigrees without recombinations Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | ||
Linear-time haplotype inference on pedigrees without recombinations and mating loops Journal:SIAM Journal on Computing | 2009 | ||
Non-shared edges and nearest neighbor interchanges revisited Journal:Information Processing Letters | 2004 | ||
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs Journal:Journal of Computational Biology | 2003 | ||
Subtree Transfer Distance for Degree-d Phylogenies Journal:International Journal of Foundations of Computer Science | 2004 | ||
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison Proceeding/Conference:Proceedings of the 11th Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science | 2000 |