Optimal recombination algorithms for generalized chains

DOI10.1080/10556780701868519zbMATH Open1218.68112OpenAlexW1973131286MaRDI QIDQ3514848FDOQ3514848

Authors: Yong He, Ting Chen 

Publication date: 23 July 2008

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

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

Recommendations

• scientific article; zbMATH DE number 1796956
• Optimal algorithms for recombination distance problem
• Optimal recombination in genetic algorithms for combinatorial optimization problems. II
• Foundations of Genetic Algorithms
• Optimal recombination in genetic algorithms for combinatorial optimization problems. I
• Algorithms and Computation
• A theory and algorithms for combinatorial reoptimization
• A theory and algorithms for combinatorial reoptimization
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants

zbMATH Keywords

computational biologyoptimal algorithmgeneralized chainrecombination distance problem

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Two strikes against the phage recombination problem
• Foundations of Genetic Algorithms
• Optimal algorithms for recombination distance problem

This page was built for publication: Optimal recombination algorithms for generalized chains

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