Algorithms for computing bidirectional best hit r-window gene clusters

DOI10.1007/978-3-642-21204-8_30MaRDI QIDQ3004680zbMATH OpenOpenAlexFDO

Authors Trong Dao Le, Melvin Zhang, Hon Wai Leong

Publication date 3 June 2011

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21204-8_30

zbMATH Keywords

bidirectional best hit \(r\)-windowgene clusterslarge-scale mutations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10)

Recommendations

• Algorithms for Finding Gene Clusters
• Combinatorial Pattern Matching
• Algorithms in bioinformatics. 1st international workshop, WABI 2001, Århus, Denmark, August 28--31, 2001. Proceedings
• Improved Algorithms for the Gene Team Problem
• scientific article; zbMATH DE number 1945185

Cites work

• An algorithmic view of gene teams
• Character sets of strings
• Fast algorithms to enumerate all common intervals of two permutations
• scientific article; zbMATH DE number 1786460 (Why is no real title available?)

Cited in

(4)

• A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands
• Improved Algorithms for the Gene Team Problem
• Algorithms for Finding Gene Clusters
• Approximate search for known gene clusters in new genomes using PQ-trees

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)