Zobrazeno 1 - 10
of 319
pro vyhledávání: '"Perfect phylogeny"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Algorithms for Molecular Biology, Vol 17, Iss 1, Pp 1-14 (2022)
Abstract Background Every tumor is composed of heterogeneous clones, each corresponding to a distinct subpopulation of cells that accumulated different types of somatic mutations, ranging from single-nucleotide variants (SNVs) to copy-number aberrati
Externí odkaz:
https://doaj.org/article/c0c1f36020bf4041a6443b41a637d644
Autor:
Leah L. Weber, Mohammed El-Kebir
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-12 (2021)
Abstract Background Cancer arises from an evolutionary process where somatic mutations give rise to clonal expansions. Reconstructing this evolutionary process is useful for treatment decision-making as well as understanding evolutionary patterns acr
Externí odkaz:
https://doaj.org/article/f19439f0def244f3b8ac725cf95b16c7
Autor:
Charith B. Karunarathna, Jinko Graham
Publikováno v:
BMC Bioinformatics, Vol 20, Iss 1, Pp 1-9 (2019)
Abstract Background A perfect phylogeny is a rooted binary tree that recursively partitions sequences. The nested partitions of a perfect phylogeny provide insight into the pattern of ancestry of genetic sequence data. For example, sequences may clus
Externí odkaz:
https://doaj.org/article/30850a364f514cd0b219f56a07eaaa89
Publikováno v:
Systematic Biology
Phylogenetic trees from real-world data often include short edges with very few substitutions per site, which can lead to partially resolved trees and poor accuracy. Theory indicates that the number of sites needed to accurately reconstruct a fully r
Autor:
David Fernández-Baca, Lei Liu
Publikováno v:
Algorithms, Vol 12, Iss 3, p 53 (2019)
We study two problems in computational phylogenetics. The first is tree compatibility. The input is a collection of phylogenetic trees over different partially-overlapping sets of species. The goal is to find a single phylogenetic tree that displays
Externí odkaz:
https://doaj.org/article/1124f1c75ab34b7aab0966c9d8e5e8ba
Publikováno v:
Systematic Biology, 68(5)
Systematic Biology, 68(5), 814-827. Oxford University Press
Systematic Biology
Systematic Biology, 68(5), 814-827
Systematic Biology, 68(5), 814-827. Oxford University Press
Systematic Biology
Systematic Biology, 68(5), 814-827
Perfect phylogenies are fundamental in the study of evolutionary trees because they capture the situation when each evolutionary trait emerges only once in history; if such events are believed to be rare, then by Occam's Razor such parsimonious trees
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030835071
WADS
WADS
Reconstructing the evolutionary history of a set of species is a central task in computational biology. In real data, it is often the case that some information is missing: the Incomplete Directed Perfect Phylogeny (IDPP) problem asks, given a collec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6421d8e07250c4c8216d1aab297f548a
https://ir.cwi.nl/pub/31064
https://ir.cwi.nl/pub/31064
Autor:
Bandelt, Hans-Jürgen, Fischer, Mareike
Publikováno v:
Systematic Biology, 2008 Aug 01. 57(4), 540-543.
Externí odkaz:
https://www.jstor.org/stable/27756373
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.