Chaining algorithms for multiple genome comparison
From MaRDI portal
Publication:2569405
DOI10.1016/j.jda.2004.08.011zbMath1110.68541OpenAlexW2017265532MaRDI QIDQ2569405
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda
Publication date: 27 October 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.011
Related Items (10)
Co-linear chaining with overlaps and gap costs ⋮ Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ Sequence to graph alignment using gap-sensitive co-linear chaining ⋮ An efficient algorithm to solve the conditional covering problem on trapezoid graphs ⋮ Fast Algorithms for Computing Tree LCS ⋮ Efficient Chaining of Seeds in Ordered Trees ⋮ Counting the number of vertex covers in a trapezoid graph ⋮ Fast algorithms for computing tree LCS ⋮ Chaining algorithms for multiple genome comparison ⋮ Distributed interactive proofs for the recognition of some geometric intersection graph classes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing all north-east nearest neighbors in the \(L_ 1\) metric
- An \(O(N^ 2 \log N)\) restriction map comparison and search algorithm
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
- Preserving order in a forest in less than logarithmic time and linear space
- Chaining algorithms for multiple genome comparison
- Multiple Genome Alignment: Chaining Algorithms Revisited
- A priority queue in which initialization and queue operations takeO(loglogD) time
- New Data Structures for Orthogonal Range Queries
- Sparse dynamic programming II
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
This page was built for publication: Chaining algorithms for multiple genome comparison
