Algorithms for computing bidirectional best hit r-window gene clusters
From MaRDI portal
Algorithms for computing bidirectional best hit \(r\)-window gene clusters
Recommendations
- Algorithms for finding gene clusters
- Quadratic time algorithms for finding common intervals in two and more sequences
- Algorithms in bioinformatics. 1st international workshop, WABI 2001, Århus, Denmark, August 28--31, 2001. Proceedings
- Improved Algorithms for the Gene Team Problem
- The algorithmic of gene teams
Cites work
Cited in
(4)
This page was built for publication: Algorithms for computing bidirectional best hit \(r\)-window gene clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004680)