An algorithmic view of gene teams

DOI10.1016/j.tcs.2004.02.036zbMath1043.92006OpenAlexW2088319085MaRDI QIDQ596107

Marie-Pierre Béal, Sylvie Corteel, Mathieu Raffinot, Anne Bergeron

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

zbMATH Keywords

AlgorithmicsComparative genomicsGene teamHopcroft's framework

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08) Software, source code, etc. for problems pertaining to biology (92-04)

Related Items

Improved approximate common interval ⋮ Algorithms for Computing Bidirectional Best Hit r-Window Gene Clusters ⋮ Competitive graph searches ⋮ Fast algorithms for identifying maximal common connected sets of interval graphs ⋮ Discovering cis-regulatory modules by optimizing barbecues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning a graph in \(O(|A|\log_ 2|V|)\)
• Fast algorithms to enumerate all common intervals of two permutations
• Three Partition Refinement Algorithms
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT