Finding all sorting tandem duplication random loss operations

DOI10.1016/j.jda.2010.09.006zbMath1211.92039OpenAlexW2093060163MaRDI QIDQ533407

Hung-Lung Wang, Daniel Merkle, Ming-Chiang Chen, Matthias Bernt, Kuan-Yu Chen, An-Chiang Chu, Martin Middendorf, Kun-Mao Chao

Publication date: 3 May 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2010.09.006

zbMATH Keywords

permutationgenome rearrangementTDRL

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Approximating the number of double cut-and-join scenarios

Cites Work

• A variant of the tandem duplication-random loss model of genome rearrangement
• Trailing the dovetail shuffle to its lair
• On the tandem duplication-random loss model of genome rearrangement
• Finding All Sorting Tandem Duplication Random Loss Operations
• Shuffling Cards and Stopping Times
• Approximating the true evolutionary distance between two genomes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding all sorting tandem duplication random loss operations