Optimal algorithms for recombination distance problem

DOI10.1080/10556780310001636648MaRDI QIDQ4650624zbMATH OpenOpenAlexFDO

Authors Yong He, Ting Chen

Publication date 18 February 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780310001636648

Mathematics Subject Classification ID

Combinatorics on words (68R15) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 1796956
• Optimal recombination algorithms for generalized chains
• Reconstructing a history of recombinations from a set of sequences
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• scientific article; zbMATH DE number 1003279

Cites work

• Fixed topology alignment with recombination
• Reconstructing a history of recombinations from a set of sequences
• Reconstructing evolution of sequences subject to recombination using parsimony

Cited in

(6)

• A fast algorithm for computing multilocus recombination
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Optimal recombination algorithms for generalized chains
• scientific article; zbMATH DE number 1796956 (Why is no real title available?)
• Foundations of Genetic Algorithms
• Algorithms and Computation

This page was built for publication: Optimal algorithms for recombination distance problem

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