Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Fast optimal leaf ordering for hierarchical clustering.

Z Bar-Joseph1, D K Gifford, T S Jaakkola

  • 1Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MA 02139, USA.

Bioinformatics (Oxford, England)
|July 27, 2001
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Intracellular crowding defines the mode and sequence of substrate uptake by Escherichia coli and constrains its metabolic activity.

Proceedings of the National Academy of Sciences of the United States of America·2007
Same author

Negative information for motif discovery.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2004
Same author

Serial regulation of transcriptional regulators in the yeast cell cycle.

Cell·2001
Same author

Blazing pathways through genetic mountains.

Science (New York, N.Y.)·2001
Same author

Using graphical models and genomic expression data to statistically validate models of genetic regulatory networks.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2001
Same author

Design and implementation of computational systems based on programmed mutagenesis.

Bio Systems·2000
Same journal

Cross-Domain Transfer Learning from Peptides to Metabolites Using a Multi-Property Fine-Tuned LLM.

Bioinformatics (Oxford, England)·2026
Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026
Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026
Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
See all related articles

We developed a new algorithm for ordering leaves in hierarchical clustering trees. This optimal leaf ordering reveals biological structures missed by current methods, improving gene expression data analysis.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Data Analysis

Background:

  • Hierarchical clustering is widely used for analyzing gene expression data.
  • Existing heuristic methods for leaf ordering may obscure biological insights.
  • The number of possible linear leaf orderings for a tree with n leaves is 2(n-1).

Purpose of the Study:

  • To present the first practical algorithm for optimal linear leaf ordering of hierarchical clustering trees.
  • To demonstrate how optimal leaf ordering can reveal hidden biological structures in gene expression data.
  • To improve upon existing heuristic ordering methods.

Main Methods:

  • Developed a novel algorithm for optimal linear leaf ordering.
  • The algorithm has a time complexity of O(n^4).

Related Experiment Videos

  • Implemented optimizations to enhance the algorithm's practical performance.

    • Main Results:

    • The optimal leaf ordering algorithm successfully reveals biological structures not apparent with heuristic methods.
    • The algorithm provides a practical approach to solving the optimal linear leaf ordering problem.
    • Demonstrated the effectiveness of the algorithm in analyzing gene expression data.

    Conclusions:

    • Optimal linear leaf ordering is crucial for uncovering biological insights from hierarchical clustering.
    • The developed algorithm offers a practical and efficient solution for optimal leaf ordering.
    • This advancement has significant implications for gene expression data analysis and biological discovery.