Constructing Phylogenetic Networks Based on the Isomorphism of Datasets.
Constructing rooted phylogenetic networks from rooted phylogenetic trees has become an important problem in molecular evolution. So far, many methods have been presented in this area, in which most efficient methods are based on the incompatible graph, such as the CASS, the LNETWORK, and the BIMLR....
| Publicado en: | BioMed Research International Vol. 2016; pp. 1 - 8 |
|---|---|
| Autores principales: | , , |
| Formato: | research tables/charts Journal Article |
| Publicado: |
Wiley-Blackwell
7/28/2016
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=117065535&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 117065535 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 23146133 FT2T jtl: BioMed Research International issn: 23146133 maglogo: N pubinfo: dt: 7/28/2016 vid: 2016 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 117065535 117065535 117065535 10.1155/2016/4236858 117065535 ppf: 1 ppct: 7 formats: fmt: @attributes: type: P tig: atl: Constructing Phylogenetic Networks Based on the Isomorphism of Datasets. aug: au: Wang, Juan Zhang, Zhibin Li, Yanjuan affil: School of Computer Science, Inner Mongolia University, Hohhot 010021, China sug: subj: Evolution Genetics Data Management Algorithms Mathematics Funding Source ab: Constructing rooted phylogenetic networks from rooted phylogenetic trees has become an important problem in molecular evolution. So far, many methods have been presented in this area, in which most efficient methods are based on the incompatible graph, such as the CASS, the LNETWORK, and the BIMLR. This paper will research the commonness of the methods based on the incompatible graph, the relationship between incompatible graph and the phylogenetic network, and the topologies of incompatible graphs. We can find out all the simplest datasets for a topology G and construct a network for every dataset. For any one dataset C, we can compute a network from the network representing the simplest dataset which is isomorphic to C. This process will save more time for the algorithms when constructing networks. pubtype: Academic Journal doctype: research tables/charts Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|