Publications related to 'weakly compatible' : A split system is weakly compatible if does not induce all three possible splits on any subset of four taxa.
 
Order by:   Type | Year
           related to:
Associated keywords
1999
1
photophoto
Vincent Berry and David Bryant. Faster reliable phylogenetic analysis. In RECOMB99, Pages 59-68, 1999.  
Keywords: abstract network, from quartets, phylogenetic network, phylogeny, polynomial, Program SplitsTree, reconstruction, split network, weakly compatible.
Note: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.9151.
       

1994
2
photophoto
Hans-Jürgen Bandelt and Andreas W. M. Dress. A relational approach to split decomposition. In H.-H. Bock, W. Lenski and M. M. Richter editors, Information Systems and Data Analysis, Proceedings of the 17th Annual Conference of the Gesellschaft Für Klassifikation (GFKL93), Vol. 42:123-131 of Studies in Classification, Data Analysis, and Knowledge Organization, springer, 1994.  
Keywords: characterization, from quartets, phylogenetic network, weakly compatible.
       

1992
3
photophoto
Hans-Jürgen Bandelt and Andreas W. M. Dress. A canonical decomposition theory for metrics on a finite set. In Advances in Mathematics, Vol. 92(1):47-105, 1992.  
Keywords: abstract network, circular split system, from distances, split, split decomposition, split network, weak hierarchy, weakly compatible.
       
Toggle abstract