Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An optimal hierarchical clustering algorithm for gene expression data

From MaRDI portal
Publication:835014
Jump to:navigation, search

DOI10.1016/j.ipl.2004.11.001zbMath1173.68773OpenAlexW1991973126MaRDI QIDQ835014

Srinivas Aluru, Srikanth Komarina, Sudip K. Seal

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.001


zbMATH Keywords

algorithmshierarchical clusteringcomputational geometrygene expressionmicroarrays


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Related Items

SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index



Cites Work

  • An optimal algorithm for closest-pair maintenance
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:835014&oldid=12773578"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 14:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki