Pages that link to "Item:Q1306405"
From MaRDI portal
The following pages link to An approximation algorithm for alignment of multiple sequences using motif discovery (Q1306405):
Displaying 14 items.
- DCA based algorithms for multiple sequence alignment (MSA) (Q301241) (← links)
- The multiple sequence sets: Problem and heuristic algorithms (Q411226) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← 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 (Q1391132) (← links)
- Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
- An optimization approach to multiple sequence alignment (Q1431885) (← links)
- The maximum weight trace alignment merging problem (Q2062010) (← links)
- Pattern-constrained multiple polypeptide sequence alignment (Q2500332) (← links)
- Adaptation of the method of musical composition for solving the multiple sequence alignment problem (Q2516112) (← links)
- Multiple sequence alignment as a facility-location problem (Q2890444) (← links)
- An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score (Q4887021) (← links)
