Sciweavers

927 search results - page 94 / 186
» Algorithms for Finding Gene Clusters
Sort
View
144
Voted
COMPLIFE
2006
Springer
15 years 7 months ago
Relational Subgroup Discovery for Descriptive Analysis of Microarray Data
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
Igor Trajkovski, Filip Zelezný, Jakub Tolar...
134
Voted
JDA
2008
122views more  JDA 2008»
15 years 3 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
124
Voted
BMCBI
2007
128views more  BMCBI 2007»
15 years 3 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
156
Voted
CIBB
2008
15 years 5 months ago
Mining Association Rule Bases from Integrated Genomic Data and Annotations
During the last decade, several clustering and association rule mining techniques have been applied to highlight groups of coregulated genes in gene expression data. Nowadays, inte...
Ricardo Martínez, Nicolas Pasquier, Claude ...
118
Voted
BMCBI
2005
109views more  BMCBI 2005»
15 years 3 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...