scholarly journals perfectphyloR: An R package for reconstructing perfect phylogenies

2019 ◽  
Vol 20 (1) ◽  
Author(s):  
Charith B. Karunarathna ◽  
Jinko Graham

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 cluster together in a partition indicating that they arise from a common ancestral haplotype. Results We present an R package to reconstruct the local perfect phylogenies underlying a sample of binary sequences. The package enables users to associate the reconstructed partitions with a user-defined partition. We describe and demonstrate the major functionality of the package. Conclusion The package should be of use to researchers seeking insight into the ancestral structure of their sequence data. The reconstructed partitions have many applications, including the mapping of trait-influencing variants.

2019 ◽  
Author(s):  
Charith Bhagya Karunarathna ◽  
Jinko Graham

AbstractBackgroundA 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 cluster together in a partition indicating that they arise from a common ancestral haplotype.ResultsWe present an R packageperfectphyloRto reconstruct the local perfect phylogenies underlying a sample of binary sequences. The package enables users to associate the reconstructed partitions with a user-defined partition. We describe and demonstrate the major functionality of the package.ConclusionTheperfectphyloRpackage should be of use to researchers seeking insight into the ancestral structure of their sequence data. The reconstructed partitions have many applications, including the mapping of trait-influencing variants.


2019 ◽  
Vol 36 (7) ◽  
pp. 2295-2297
Author(s):  
Christina Nieuwoudt ◽  
Angela Brooks-Wilson ◽  
Jinko Graham

Abstract Summary We present the R package SimRVSequences to simulate sequence data for pedigrees. SimRVSequences allows for simulations of large numbers of single-nucleotide variants (SNVs) and scales well with increasing numbers of pedigrees. Users provide a sample of pedigrees and SNV data from a sample of unrelated individuals. Availability and implementation SimRVSequences is publicly-available on CRAN https://cran.r-project.org/web/packages/SimRVSequences/. Supplementary information Supplementary data are available at Bioinformatics online.


2020 ◽  
Vol 39 (3) ◽  
pp. 31-37 ◽  
Author(s):  
Muhammad Saqib Sohail ◽  
Ahmed A. Quadeer ◽  
Matthew R. McKay

1990 ◽  
Vol 18 (suppl) ◽  
pp. 2367-2411 ◽  
Author(s):  
K.-n. Wada ◽  
S.-i. Aota ◽  
R. Tsuchiya ◽  
F. Ishibashi ◽  
T. Gojobori ◽  
...  

2006 ◽  
Vol 10 (1) ◽  
pp. 97-109 ◽  
Author(s):  
S. Grünewald ◽  
K. T. Huber

1993 ◽  
Vol 7 (3) ◽  
pp. 361-368
Author(s):  
R. W. Chen ◽  
F. K. Hwang ◽  
Y. C. Yao ◽  
A. Zame

Knockout tournaments are often used in sports (or experiments where preferences are registered by comparisons instead of measurements) to determine the champion of an event. A knockout tournament plan (KTP) for n players is a rooted binary tree with n leaves to be labeled by the n players. Each subtree of two leaves represents a match between the two players labeling the two leaves; the winner of the match then moves on to label the root of the subtree. While there are many KTPs to choose from for a given number of players, in the real world an almost balanced KTP is usually chosen. One reason could be the perception that a balanced KTP is “fair” to the players, in the sense that, given a random labeling of leaves by players, a stronger player has a better chance to win the tournament. Surprisingly, it has been shown that not all KTPs have this property, and it is difficult to prove this property for any general class of KTPs. So far the property has been shown to hold only for balanced KTPs. In this paper we extend it to some classes of almost balanced KTPs.


Genome ◽  
2020 ◽  
Vol 63 (6) ◽  
pp. 291-305 ◽  
Author(s):  
Cameron M. Nugent ◽  
Tyler A. Elliott ◽  
Sujeevan Ratnasingham ◽  
Sarah J. Adamowicz

Biological conclusions based on DNA barcoding and metabarcoding analyses can be strongly influenced by the methods utilized for data generation and curation, leading to varying levels of success in the separation of biological variation from experimental error. The 5′ region of cytochrome c oxidase subunit I (COI-5P) is the most common barcode gene for animals, with conserved structure and function that allows for biologically informed error identification. Here, we present coil ( https://CRAN.R-project.org/package=coil ), an R package for the pre-processing and frameshift error assessment of COI-5P animal barcode and metabarcode sequence data. The package contains functions for placement of barcodes into a common reading frame, accurate translation of sequences to amino acids, and highlighting insertion and deletion errors. The analysis of 10 000 barcode sequences of varying quality demonstrated how coil can place barcode sequences in reading frame and distinguish sequences containing indel errors from error-free sequences with greater than 97.5% accuracy. Package limitations were tested through the analysis of COI-5P sequences from the plant and fungal kingdoms as well as the analysis of potential contaminants: nuclear mitochondrial pseudogenes and Wolbachia COI-5P sequences. Results demonstrated that coil is a strong technical error identification method but is not reliable for detecting all biological contaminants.


2020 ◽  
Vol 26 ◽  
pp. 100411 ◽  
Author(s):  
Jim Gaffney ◽  
Redeat Tibebu ◽  
Rebecca Bart ◽  
Getu Beyene ◽  
Dejene Girma ◽  
...  

1992 ◽  
Vol 20 (suppl) ◽  
pp. 2111-2118 ◽  
Author(s):  
K.-n. Wada ◽  
Y. Wada ◽  
F. Ishibashi ◽  
T. Gojobori ◽  
T. Ikemura

Sign in / Sign up

Export Citation Format

Share Document