Algorithms for finding gene clusters
From MaRDI portal
Recommendations
- Combinatorial Pattern Matching
- Extending common intervals searching from permutations to sequences
- Common intervals of multiple permutations
- Algorithms for computing bidirectional best hit r-window gene clusters
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
Cited in
(22)- PK-means: A new algorithm for gene clustering
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- The complexity of gene placement
- An algorithmic view on multi-related-segments: a unifying model for approximate common interval
- Gene clusters as intersections of powers of paths
- Algorithms for computing bidirectional best hit r-window gene clusters
- Predicting Gene Function using Predictive Clustering Trees
- scientific article; zbMATH DE number 5343761 (Why is no real title available?)
- Improved Algorithms for the Gene Team Problem
- The algorithmic of gene teams
- Error detection and correction of gene trees
- The potential of family-free genome comparison
- Common intervals of multiple permutations
- A Method of Finding Predictor Genes for a Particular Disease Using a Clustering Algorithm
- Comparative Genomics
- Comparative Genomics
- Combinatorial Pattern Matching
- An algorithmic view of gene teams
- Approximate search for known gene clusters in new genomes using PQ-trees
- Common intervals of trees
- Comparing bacterial genomes from linear orders of patterns
This page was built for publication: Algorithms for finding gene clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4801159)
