The algorithmic of gene teams

DOI10.1007/3-540-45784-4_36MaRDI QIDQ4410162zbMATH OpenFDO

Authors Anne Bergeron, Mathieu Raffinot, Sylvie Corteel

Publication date 2 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520464.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Recommendations

• An algorithmic view of gene teams
• Improved Algorithms for the Gene Team Problem
• Algorithms for finding gene clusters
• Combinatorial Pattern Matching
• OMG! Orthologs in multiple genomes -- competing graph-theoretical formulations

Cited in

(9)

• Algorithms for computing bidirectional best hit r-window gene clusters
• Improved Algorithms for the Gene Team Problem
• scientific article; zbMATH DE number 2080225 (Why is no real title available?)
• Error detection and correction of gene trees
• The potential of family-free genome comparison
• On the approximability of the minimum weight t-partite clique problem
• An algorithmic view of gene teams
• Approximate search for known gene clusters in new genomes using PQ-trees
• Measures for the exceptionality of gene order in conserved genomic regions

This page was built for publication: The algorithmic of gene teams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410162)