Algorithms for Finding Gene Clusters
From MaRDI portal
Publication:4801159
DOI10.1007/3-540-44696-6_20zbMATH Open1129.92305OpenAlexW1568869859MaRDI QIDQ4801159FDOQ4801159
Authors: Steffen Heber, Jens Stoye
Publication date: 6 April 2003
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44696-6_20
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
Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Cited In (22)
- Combinatorial Pattern Matching
- Error detection and correction of gene trees
- Common intervals of trees
- Improved Algorithms for the Gene Team Problem
- Comparative Genomics
- Title not available (Why is that?)
- The complexity of gene placement
- An algorithmic view of gene teams
- Gene clusters as intersections of powers of paths
- Algorithms for computing bidirectional best hit \(r\)-window gene clusters
- A Method of Finding Predictor Genes for a Particular Disease Using a Clustering Algorithm
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- Common intervals of multiple permutations
- Approximate search for known gene clusters in new genomes using PQ-trees
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- Title not available (Why is that?)
- PK-means: A new algorithm for gene clustering
- An algorithmic view on multi-related-segments: a unifying model for approximate common interval
- Comparing bacterial genomes from linear orders of patterns
- Predicting Gene Function using Predictive Clustering Trees
- Comparative Genomics
- The potential of family-free genome comparison
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)