Pages that link to "Item:Q1189709"
From MaRDI portal
The following pages link to A time-efficient, linar-space local similarity algorithm (Q1189709):
Displaying 21 items.
- Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification (Q850138) (← links)
- An efficient alignment algorithm for masked sequences (Q868939) (← links)
- Computing similarity of run-length encoded strings with affine gap penalty (Q932322) (← links)
- Locally optimal subalignments using nonlinear similarity functions (Q1090289) (← links)
- Constrained sequence alignment (Q1209899) (← links)
- A technique to find multiple motif occurrences in a biomolecular sequence (Q1293207) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- Elucidating the protein cold-adaptation: investigation of the parameters enhancing protein psychrophilicity (Q1798111) (← links)
- On spaced seeds for similarity search (Q1827801) (← links)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds (Q1878677) (← links)
- Linear-space algorithms that build local alignments from fragments (Q1902469) (← links)
- Global and local sequence alignment with a bounded number of gaps (Q2342666) (← links)
- The ribosome as a missing link in the evolution of life (Q2415772) (← links)
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment (Q2502285) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS (Q3021984) (← links)
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS (Q3421848) (← links)
- Computing and Combinatorics (Q4681206) (← links)
- Efficient algorithms for local alignment search (Q5935741) (← links)
- Efficient algorithms for similarity search (Q5935742) (← links)
- Local multiple alignment via subgraph enumeration (Q5961633) (← links)
