Sökning: onr:"swepub:oai:DiVA.org:su-199758" >
Combining Orthology...
-
Hellmuth, MarcStockholms universitet,Matematiska institutionen
(författare)
Combining Orthology and Xenology Data in a Common Phylogenetic Tree
- Artikel/kapitelEngelska2021
Förlag, utgivningsår, omfång ...
-
2021-11-23
-
Cham :Springer,2021
-
printrdacarrier
Nummerbeteckningar
-
LIBRIS-ID:oai:DiVA.org:su-199758
-
https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199758URI
-
https://doi.org/10.1007/978-3-030-91814-9_5DOI
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:kon swepub-publicationtype
Anmärkningar
-
In mathematical phylogenetics, types of events in a gene tree T are formalized by vertex labels t(v) and set-valued edge labels λ(e). The orthology and paralogy relations between genes are a special case of a map δ on the pairs of leaves of T defined by δ(x,y)=q if the last common ancestor lca(x,y) of x and y is labeled by an event type q, e.g., speciation or duplication. Similarly, a map εε with m∈ε(x,y) if m∈λ(e) for at least one edge e along the path from lca(x,y) to y generalizes xenology, i.e., horizontal gene transfer. We show that a pair of maps (δ,ε) derives from a tree (T,t,λ) in this manner if and only if there exists a common refinement of the (unique) least-resolved vertex labeled tree (Tδ,tδ) that explains δ and the (unique) least-resolved edge labeled tree (Tε,λε) that explains ε (provided both trees exist). This result remains true if certain combinations of labels at incident vertices and edges are forbidden.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Michel, Mira
(författare)
-
Nøjgaard, Nikolai N.
(författare)
-
Schaller, David
(författare)
-
Stadler, Peter F.
(författare)
-
Stockholms universitetMatematiska institutionen
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Advances in Bioinformatics and Computational BiologyCham : Springer, s. 53-6497830309181329783030918149
Internetlänk
Hitta via bibliotek
Till lärosätets databas