An algorithmic view of gene teams
From MaRDI portal
Publication:596107
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1945185 (Why is no real title available?)
- scientific article; zbMATH DE number 1786460 (Why is no real title available?)
- Fast algorithms to enumerate all common intervals of two permutations
- Partition refinement techniques: an interesting algorithmic tool kit
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Three Partition Refinement Algorithms
Cited in
(8)- Improved Algorithms for the Gene Team Problem
- scientific article; zbMATH DE number 1945185 (Why is no real title available?)
- Algorithms for computing bidirectional best hit \(r\)-window gene clusters
- Competitive graph searches
- Discovering cis-regulatory modules by optimizing barbecues
- Improved approximate common interval
- Fast algorithms for identifying maximal common connected sets of interval graphs
- scientific article; zbMATH DE number 2080225 (Why is no real title available?)
This page was built for publication: An algorithmic view of gene teams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596107)