Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

DOI10.1016/S0304-3975(98)00093-0zbMath0915.68034MaRDI QIDQ1274606

Hiroshi Imai, Takahiro Ikeda

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

multiple alignment\(A\) algorithm\(A^{*}\) algorithmgroup alignment

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Related Items (4)

An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Controlling the learning process of real-time heuristic search ⋮ Average-case analysis of best-first search in two representative directed acyclic graphs

Cites Work

• Unnamed Item
• Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths
• The Multiple Sequence Alignment Problem in Biology

This page was built for publication: Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases