An efficiently computed lower bound on the number of recombinations in phylogenetic networks : Theory and empirical study: Computational molecular biology series, issue V

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete applied mathematics 2007, Vol.155 (6-7), p.806-830
Hauptverfasser:	GUSFIELD, Dan, HICKERSON, Dean, EDDHU, Satish
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Biological and medical sciences Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology Fundamental and applied biological sciences. Psychology General aspects Graph theory Mathematics Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:
ISSN:	0166-218X 1872-6771