Engineering Applications of Artificial Intelligence
An ant colony optimization algorithm for DNA sequencing by hybridization
Computers and Operations Research
Algorithm: Dealing with repetitions in sequencing by hybridization
Computational Biology and Chemistry
Accurate Reconstruction for DNA Sequencing by Hybridization Based on a Constructive Heuristic
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
New constructive heuristics for DNA sequencing by hybridization
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Multi-level ant colony optimization for DNA sequencing by hybridization
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Computational options for bioinformatics research in evolutionary biology
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An integer programming approach to DNA sequence assembly
Computational Biology and Chemistry
Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
Computers and Operations Research
| Hi-index | 3.84 |
Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process. Results: The present method outperforms those described in previous studies, in terms of both time and accuracy. Availability: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html