The era of the ARG: An introduction to ancestral recombination graphs and their significance in empirical evolutionary genomics
In the presence of recombination, the evolutionary relationships between a set of sampled
genomes cannot be described by a single genealogical tree. Instead, the genomes are …
genomes cannot be described by a single genealogical tree. Instead, the genomes are …
A general and efficient representation of ancestral recombination graphs
As a result of recombination, adjacent nucleotides can have different paths of genetic
inheritance and therefore the genealogical trees for a sample of DNA sequences vary along …
inheritance and therefore the genealogical trees for a sample of DNA sequences vary along …
[图书][B] Fundamentals of parameterized complexity
RG Downey, MR Fellows - 2013 - Springer
Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
Genomic characterization of nontuberculous mycobacteria
T Fedrizzi, CJ Meehan, A Grottola, E Giacobazzi… - Scientific reports, 2017 - nature.com
Mycobacterium tuberculosis and Mycobacterium leprae have remained, for many years, the
primary species of the genus Mycobacterium of clinical and microbiological interest. The …
primary species of the genus Mycobacterium of clinical and microbiological interest. The …
Inferring horizontal gene transfer
M Ravenhall, N Škunca, F Lassalle… - PLoS computational …, 2015 - journals.plos.org
Horizontal or Lateral Gene Transfer (HGT or LGT) is the transmission of portions of genomic
DNA between organisms through a process decoupled from vertical inheritance. In the …
DNA between organisms through a process decoupled from vertical inheritance. In the …
A survey of frequent subgraph mining algorithms
Graph mining is an important research area within the domain of data mining. The field of
study concentrates on the identification of frequent subgraphs within graph data sets. The …
study concentrates on the identification of frequent subgraphs within graph data sets. The …
Subtree transfer operations and their induced metrics on evolutionary trees
BL Allen, M Steel - Annals of combinatorics, 2001 - Springer
Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in
biology. In this setting, extant species label the leaves of the tree, while the internal vertices …
biology. In this setting, extant species label the leaves of the tree, while the internal vertices …
treespace: Statistical exploration of landscapes of phylogenetic trees
The increasing availability of large genomic data sets as well as the advent of Bayesian
phylogenetics facilitates the investigation of phylogenetic incongruence, which can result in …
phylogenetics facilitates the investigation of phylogenetic incongruence, which can result in …
[图书][B] Computational phylogenetics: an introduction to designing methods for phylogeny estimation
T Warnow - 2018 - books.google.com
A comprehensive account of both basic and advanced material in phylogeny estimation,
focusing on computational and statistical issues. No background in biology or computer …
focusing on computational and statistical issues. No background in biology or computer …
On the computational complexity of the rooted subtree prune and regraft distance
M Bordewich, C Semple - Annals of combinatorics, 2005 - Springer
The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used
as a tool for understanding and modelling reticulation events in evolutionary biology. In this …
as a tool for understanding and modelling reticulation events in evolutionary biology. In this …