Pages that link to "Item:Q1902469"
From MaRDI portal
The following pages link to Linear-space algorithms that build local alignments from fragments (Q1902469):
Displaying 13 items.
- A versatile divide and conquer technique for optimal string alignment (Q294680) (← links)
- An efficient alignment algorithm for masked sequences (Q868939) (← links)
- Locally optimal subalignments using nonlinear similarity functions (Q1090289) (← links)
- A time-efficient, linar-space local similarity algorithm (Q1189709) (← links)
- On computing all suboptimal alignments (Q1291563) (← links)
- A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences (Q1861731) (← links)
- Aligning two fragmented sequences (Q1868717) (← links)
- An almost quadratic time algorithm for sparse spliced alignment (Q2429729) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- (Q3044314) (← links)
- Computing and Combinatorics (Q4681206) (← links)
- Efficient algorithms for local alignment search (Q5935741) (← links)
- Local multiple alignment via subgraph enumeration (Q5961633) (← links)