An algorithmic view of gene teams
DOI10.1016/J.TCS.2004.02.036zbMATH Open1043.92006OpenAlexW2088319085MaRDI QIDQ596107FDOQ596107
Authors: Marie-Pierre Béal, Anne Bergeron, Sylvie Corteel, Mathieu Raffinot 
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00619206/file/hal.pdf
Recommendations
Complexity and performance of numerical algorithms (65Y20) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Title not available (Why is that?)
- Three Partition Refinement Algorithms
- Title not available (Why is that?)
- Fast algorithms to enumerate all common intervals of two permutations
- Partition refinement techniques: an interesting algorithmic tool kit
- Title not available (Why is that?)
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Title not available (Why is that?)
Cited In (8)
- Improved Algorithms for the Gene Team Problem
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
