Results: A new algorithm is developed which is intended to find groups of genes whose expression values change in a concordant manner in a series of experiments with DNA arrays. This algorithm is named as CoexpressionFinder. It can find more complete and internally coordinated groups of gene expression vectors than hierarchical clustering. Also, it finds more genes having coordinated expression. The algorithm's design allows parallel execution.
Availability: The algorithm is implemented as a Java application which is freely available at: http://www.bioinformatics.ru/cf/index.jsp and http://bioinformatics.ru/cf/index.jsp.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1142/s0219720006002193 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Coexpressionfinder: a new algorithm for finding groups of coexpressed genes.
J Bioinform Comput Biol
August 2006
Laboratory of Post-Genome Methods in Biology, Department of Molecular Biology and Genetics, Research Institute of Physico-Chemical Medicine, M.Pirogovskaya 1a, Moscow, Russia.
Results: A new algorithm is developed which is intended to find groups of genes whose expression values change in a concordant manner in a series of experiments with DNA arrays. This algorithm is named as CoexpressionFinder. It can find more complete and internally coordinated groups of gene expression vectors than hierarchical clustering.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!