Algorithms of ancestral gene length reconstruction.
Ancestral sequence reconstruction is a well-known problem in molecular evolution. The problem presented in this study is inspired by sequence reconstruction, but instead of leaf-associated sequences we consider only their lengths. We call this problem ancestral gene length reconstruction. It is a pr...
| Publicado en: | BioMed Research International Vol. 2013; pp. 472163 - 472164 |
|---|---|
| Autores principales: | , |
| Formato: | review Journal Article |
| Publicado: |
Wiley-Blackwell
2013
|
| 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=104135846&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 104135846 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 23146133 FT2T jtl: BioMed Research International issn: 23146133 maglogo: N pubinfo: dt: 2013 vid: 2013 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 104135846 104135846 2012423362 NLM24371824 PMC3858891 104135846 ppf: 472163 ppct: 1 formats: fmt: @attributes: type: P tig: atl: Algorithms of ancestral gene length reconstruction. aug: au: Bolshoy, Alexander Kirzhner, Valery M affil: Department of Evolutionary and Environmental Biology, Institute of Evolution, University of Haifa, 199 Aba-Hushi Avenue, Mount Carmel, Haifa 3498838, Israel ; Institute of Evolution, University of Haifa, Mount Carmel., Haifa 39105, Israel. sug: subj: Molecular Structure Evolution Models, Theoretical Algorithms Sequence Analysis ab: Ancestral sequence reconstruction is a well-known problem in molecular evolution. The problem presented in this study is inspired by sequence reconstruction, but instead of leaf-associated sequences we consider only their lengths. We call this problem ancestral gene length reconstruction. It is a problem of finding an optimal labeling which minimizes the total length's sum of the edges, where both a tree and nonnegative integers associated with corresponding leaves of the tree are the input. In this paper we give a linear algorithm to solve the problem on binary trees for the Manhattan cost function S(v, w) = |π(v) - π(w) |. pubtype: Academic Journal doctype: review Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|