Pages that link to "Item:Q2569405"
From MaRDI portal
The following pages link to Chaining algorithms for multiple genome comparison (Q2569405):
Displayed 10 items.
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- Efficient Chaining of Seeds in Ordered Trees (Q3000514) (← links)
- Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
- Sequence to graph alignment using gap-sensitive co-linear chaining (Q6070707) (← links)