Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
From MaRDI portal
Publication:1937885
DOI10.1007/s00285-011-0503-8zbMath1258.92030arXiv1008.0153OpenAlexW3106095402WikidataQ51450974 ScholiaQ51450974MaRDI QIDQ1937885
Publication date: 1 February 2013
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0153
Problems related to evolution (92D15) Applications of graph theory (05C90) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Directed graphs (digraphs), tournaments (05C20)
Related Items (6)
Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution ⋮ Leaf-Reconstructibility of Phylogenetic Networks ⋮ Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes ⋮ Reconstructing pedigrees using probabilistic analysis of ISSR amplification ⋮ The existence and abundance of ghost ancestors in biparental populations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structuring causal trees
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Recovering a tree from the leaf colourations it generates under a Markov model
- Mathematical and statistical methods for genetic analysis.
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Reconstructing pedigrees: a stochastic perspective
- Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question
- Probabilistic Functions of Finite State Markov Chains
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
This page was built for publication: Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
