Publisher
Public Library of Science (PLoS)
Reference32 articles.
1. Theory and algorithms for plan merging;DE Foulser;Artif Intell,1992
2. Complexity of common subsequence and supersequence problems and related problems;VG Timkovskii;Cybernetics and Systems Analysis,1989
3. The consensus string problem for a metric is NP-complete;JS Sim;J of Discrete Algorithms,2003
4. The shortest common supersequence problem in a microarray production setting;S Rahmann;Bioinformatics,2003
5. A post-processing method for optimizing synthesis strategy for oligonucleotide microarrays;K Ning;Nucleic Acids Res,2005
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation;Evolutionary Computation in Combinatorial Optimization;2022
2. A Cloud-Fog Based Environment Using Beam Search Algorithm in Smart Grid;Advances in Network-Based Information Systems;2018-08-28
3. Memetic Algorithms;Handbook of Heuristics;2018
4. Hybrid Metaheuristics;Artificial Intelligence: Foundations, Theory, and Algorithms;2016
5. Memetic Algorithms;Handbook of Heuristics;2016