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

Exact and heuristic algorithms for weighted cluster editing.

Sven Rahmann1, Tobias Wittkop, Jan Baumbach

  • 1Computational Methods for Emerging Technologies group, Genome Informatics, Technische Fakultät, Bielefeld University, D-33594 Bielefeld, Germany. Sven.Rahmann@cebitec.uni-bielefeld.de

Computational Systems Bioinformatics. Computational Systems Bioinformatics Conference
|October 24, 2007
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

Inferring and evaluating network medicine-based disease modules with nextflow.

Bioinformatics (Oxford, England)·2026
Same author

Aberrant splicing in human cancer shows possible functional impact on transcription factors.

Oncogene·2026
Same author

An Integrated Skin Cell Atlas Decodes the Pilosebaceous Unit.

The Journal of investigative dermatology·2026
Same author

Phenotypic similarity of adverse drug reactions and disease phenotypes is a bridge to mechanistic discovery.

npj drug discovery·2026
Same author

Origin of sexual dimorphism in osteoarthritis risk: the impact of pregnancy and parental care.

BMC public health·2026
Same author

Drugst.One DREAM-Drug repurposing through expert annotation and modification.

British journal of pharmacology·2026
Same journal

Novel Gene Discovery in the Human Malaria Parasite using Nucleosome Positioning Data.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2014
Same journal

Proceedings of Computational Systems Bioinformatics 2008. August 26-29, 2008. Palo Alto, California, USA.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Graph wavelet alignment kernels for drug virtual screening.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Fast multisegment alignments for temporal expression profiles.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Knowledge representation and data mining for biological imaging.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Efficient haplotype inference from pedigrees with missing data using linear systems with disjoint-set data structures.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
See all related articles

This study introduces new algorithms for improving biological data clustering by refining graph structures. These methods enhance the accuracy of gene family and microarray analysis, offering better solutions for complex biological data organization.

Area of Science:

  • Computational Biology
  • Graph Theory
  • Bioinformatics

Background:

  • Clustering is crucial in computational biology for tasks like orthologous gene family identification and microarray data analysis.
  • Existing clustering methods often yield suboptimal results, necessitating refinement techniques.
  • The problem of improving clusterings can be framed as graph projection onto transitive graphs, known as cluster editing.

Purpose of the Study:

  • To address the weighted cluster editing problem by allowing arbitrary weights on similarity graphs.
  • To develop and evaluate novel algorithms for improving initial clusterings in biological data.
  • To compare the performance of exact and heuristic algorithms on various graph types.

Main Methods:

  • Developed the first exact fixed-parameter algorithm for weighted cluster editing.

Related Experiment Videos

  • Proposed a polynomial-time greedy algorithm with optimality guarantees for specific graph types.
  • Implemented a fast heuristic algorithm inspired by graph layout techniques.
  • Evaluated algorithms on artificial and real-world protein similarity graphs from the COG dataset.

    • Main Results:

    • The exact fixed-parameter algorithm provides optimal solutions for weighted cluster editing.
    • The greedy algorithm achieves optimal results on close-to-transitive graphs and performs well heuristically on others.
    • The fast heuristic offers a practical approach for large datasets.
    • Comparative analysis demonstrates the effectiveness of the proposed algorithms in terms of quality and runtime.

    Conclusions:

    • The presented algorithms offer significant improvements for the weighted cluster editing problem in computational biology.
    • These methods enhance the reliability of clustering results for applications like gene family analysis.
    • The study provides a valuable toolkit for refining biological data structures and uncovering complex relationships.