New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Faster reliable phylogenetic analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Fast algorithms for constructing optimal trees from quartets
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Static and kinetic geometric spanners with applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Maximum likelihood on four taxa phylogenetic trees: analytic solutions
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
From Quartets to Phylogenetic Trees
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Minimum Quartet Inconsistency Is Fixed Parameter Tractable
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
On the consistency of the minimum evolution principle of phylogenetic inference
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
A fixed-parameter algorithm for minimum quartet inconsistency
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
Additive sparse spanners for graphs with bounded length of largest induced cycle
Theoretical Computer Science
Analytic solutions for three taxon ML trees with variable rates across sites
Discrete Applied Mathematics
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
Information Processing Letters
Quartet-Based Phylogeny Reconstruction with Answer Set Programming
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
Random Structures & Algorithms
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
Additive spanners for k-chordal graphs
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
A simple linear time algorithm for computing a (2k - 1)-spanner of o(n1+1/k) size in weighted graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
New fixed-parameter algorithms for the minimum quartet inconsistency problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms
Discrete Applied Mathematics
ACOPHY: a simple and general ant colony optimization approach for phylogenetic tree reconstruction
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
On the facets of the secondary polytope
Journal of Combinatorial Theory Series A
Parallel implementation of a quartet-based algorithm for phylogenetic analysis
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Topology discovery of sparse random graphs with few participants
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Topology discovery of sparse random graphs with few participants
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Learning Latent Tree Graphical Models
The Journal of Machine Learning Research
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Combinatorics and Geometry of Finite and Infinite Squaregraphs
SIAM Journal on Discrete Mathematics
Small stretch spanners on dynamic graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Kernel and fast algorithm for dense triplet inconsistency
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A lookahead branch-and-bound algorithm for the maximum quartet consistency problem
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Fixed-parameter tractability of the maximum agreement supertree problem
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Note: Injectivity and weak ternary separation
Discrete Applied Mathematics
Kernel and fast algorithm for dense triplet inconsistency
Theoretical Computer Science
Testing consistency of quartet topologies: A parameterized approach
Information Processing Letters
| Hi-index | 0.00 |
Branching structures, alias topological tree structures are fundamental to any hierarchical classification that aims to relate objects according to their similarities or dissimilarities. This paper provides a rigorous treatment of these structures, and continues previous work of Colonius and Schulze on H-structures. Thus extensive use is made of the so-called neighbors relation associated with a dissimilarity index. Arbitrary dissimilarity data are then analyzed by comparing their neighbors relations with ideal, that is, tree-like relations: if it matches an ideal relation, then one can readily construct a tree representing the data that is optimal in a certain sense. Finally, some algorithms are proposed for fitting observed data to tree-like data.