Pages that link to "Item:Q4037677"
From MaRDI portal
The following pages link to Multiple Alignment, Communication Cost, and Graph Matching (Q4037677):
Displaying 19 items.
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
- Enhanced \(A^{*}\) algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases (Q1274606) (← links)
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree (Q1281780) (← links)
- Approximation algorithms for multi-index transportation problems with decomposable costs (Q1363755) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
- The approximate period problem for DNA alphabet. (Q1401415) (← links)
- An optimization approach to multiple sequence alignment (Q1431885) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions (Q1868715) (← links)
- Finding similar regions in many sequences (Q1869936) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- On the complexity of sequence to graph alignment (Q2415245) (← links)
- Multiple sequence alignment as a facility-location problem (Q2890444) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) (Q5057461) (← links)
- Near optimal multiple alignment within a band in polynomial time (Q5925273) (← links)
- Local multiple alignment via subgraph enumeration (Q5961633) (← links)
