Pages that link to "Item:Q1274606"
From MaRDI portal
The following pages link to Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases (Q1274606):
Displaying 6 items.
- Controlling the learning process of real-time heuristic search (Q814454) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- A dynamic programming algorithm to find all solutions in a neighborhood of the optimum (Q1072453) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- Potential-based bounded-cost search and anytime non-parametric A* (Q2014923) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
