scientific article; zbMATH DE number 2073943

MaRDI QIDQ4468952zbMATH OpenFDO

Authors Yumin Tao, Zhongxi Mo, Yang Liu, Qinghua Ren, Suzhen Li

Publication date 14 June 2004

zbMATH Keywords

approximation algorithmbreakpoint graphgenome rearrangementsorting by reversals

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08) Biochemistry, molecular biology (92C40)

Recommendations

• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• An improved genetic algorithm for problem of genome rearrangement
• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• scientific article; zbMATH DE number 1947393
• An approximation algorithm for sorting by reversals and transpositions

Cited in

(12)

• A 2-approximation algorithm for genome rearrangements by reversals and transpositions
• A fast algorithm for computing multilocus recombination
• A further improved approximation algorithm for breakpoint graph decomposition
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• The matrix iteration algorithm solving an enumeration problem on bacterial complete genomes
• Can a breakpoint graph be decomposed into none other than 2-cycles?
• A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
• Approximation algorithms for the median problem in the breakpoint model
• An improved genetic algorithm for problem of genome rearrangement
• scientific article; zbMATH DE number 7651113 (Why is no real title available?)
• Algorithms and Computation
• The complexity of genome rearrangement combinatorics under the infinite sites model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4468952)