Cargando…
Incompatible quartets, triplets, and characters
We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r) such that, for any set C of r-state characters, C is compatible if and only if every subset of f(r) characters of C is compatible. We show that...
Autores principales: | Shutters, Brad, Vakati, Sudheer, Fernández-Baca, David |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3694002/ https://www.ncbi.nlm.nih.gov/pubmed/23547777 http://dx.doi.org/10.1186/1748-7188-8-11 |
Ejemplares similares
-
Characterizing compatibility and agreement of unrooted trees via cuts in graphs
por: Vakati, Sudheer, et al.
Publicado: (2014) -
Algorithms for Computing the Triplet Quartet Distances for Binary General Trees
por: Sand, Andreas, et al.
Publicado: (2013) -
String quartet no. 1 ; String quartet no. 2 ; String quartet no. 3
por: Piston, Walter, 1894-1976
Publicado: (1988) -
Exploring biological interaction networks with tailored weighted quasi-bicliques
por: Chang, Wen-Chieh, et al.
Publicado: (2012) -
Quartet /
por: Grellet, Françoise
Publicado: (1982)