Multiple Sequence Alignment by Ant Colony Optimization and Divide-and-Conquer
DOI10.1007/11758525_88zbMATH Open1155.92312OpenAlexW1513979102MaRDI QIDQ3545121FDOQ3545121
Authors: Yixin Chen, Juan Chen, Wei Liu, Ling Chen, Yi Pan 
Publication date: 9 December 2008
Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11758525_88
Recommendations
- An Ant-Based Model for Multiple Sequence Alignment
- scientific article; zbMATH DE number 1785848
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- scientific article; zbMATH DE number 5171932
- Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Biochemistry, molecular biology (92C40)
Cited In (8)
- An Ant-Based Model for Multiple Sequence Alignment
- Multiple DNA sequence alignment based on genetic simulated annealing techniques
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization
- Multiobjective artificial fish swarm algorithm for multiple sequence alignment
- An adaptive and iterative algorithm for refining multiple sequence alignment
- AI 2005: Advances in Artificial Intelligence
- Hybrid iterated local search algorithm for solving multiple sequences alignment problem
- Title not available (Why is that?)
This page was built for publication: Multiple Sequence Alignment by Ant Colony Optimization and Divide-and-Conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545121)
