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 Concept Videos

Heuristics01:21

Heuristics

192
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
192
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

244
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
244
The Availability Heuristic01:08

The Availability Heuristic

6.7K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
6.7K
Vector Algebra: Graphical Method01:10

Vector Algebra: Graphical Method

15.6K
Vectors can be multiplied by scalars, added to other vectors, or subtracted from other vectors. The vector sum of two (or more) vectors is called the resultant vector or, for short, the resultant.
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
15.6K
Optimal Foraging00:48

Optimal Foraging

12.6K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
12.6K
The Anchoring-and-Adjustment Heuristic01:25

The Anchoring-and-Adjustment Heuristic

7.5K
In order to make good decisions, we use our knowledge and our reasoning. Often, this knowledge and reasoning is sound and solid. However, sometimes, we are swayed by biases or by others manipulating a situation. For example, let’s say you and three friends wanted to rent a house and had a combined target budget of $1,600. The realtor shows you only very run-down houses for $1,600 and then shows you a very nice house for $2,000. Might you ask each person to pay more in rent to get the...
7.5K

You might also read

Related Articles

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

Sort by
Same author

SynKit: A Graph-Based Python Framework for Rule-Based Reaction Modeling and Analysis.

Journal of chemical information and modeling·2025
Same author

TRAMbio: a flexible python package for graph rigidity analysis of macromolecules.

BMC bioinformatics·2025
Same author

Democratising Artificial Intelligence for Pandemic Preparedness and Global Governance in Latin American and Caribbean Countries.

Microbial biotechnology·2025
Same author

Orthology and near-cographs in the context of phylogenetic networks.

Algorithms for molecular biology : AMB·2025
Same author

KGG: Knowledge-Guided Graph Self-Supervised Learning to Enhance Molecular Property Predictions.

Journal of chemical information and modeling·2025
Same author

Prediction of Circular RNA Secondary Structures and Their Targets.

Advances in experimental medicine and biology·2025
Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026
Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026
Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026
Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026
Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026
Same journal

Comparing the ability of embedding methods on metabolic hypergraphs for capturing taxonomy-based features.

Algorithms for molecular biology : AMB·2026
See all related articles

Related Experiment Video

Updated: Oct 23, 2025

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.6K

Heuristic algorithms for best match graph editing.

David Schaller1,2, Manuela Geiß3, Marc Hellmuth4

  • 1Max Planck Institute for Mathematics in the Sciences, Inselstraße 22, D-04109 Leipzig, Leipzig, Germany. sdavid@bioinf.uni-leipzig.de.

Algorithms for Molecular Biology : AMB
|August 18, 2021
PubMed
Summary
This summary is machine-generated.

Best match graphs (BMGs), used in phylogenetics, can now be corrected from noisy data. New graph editing algorithms provide accurate and efficient error correction for BMGs, improving gene relationship analysis.

Keywords:
Arc modification problemsConsistent algorithmHeuristic algorithmNP-hardness

More Related Videos

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

772
A Nonsequencing Approach for the Rapid Detection of RNA Editing
08:50

A Nonsequencing Approach for the Rapid Detection of RNA Editing

Published on: April 21, 2022

2.7K

Related Experiment Videos

Last Updated: Oct 23, 2025

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

35.6K
Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems
05:47

Evidence-based Knowledge Synthesis and Hypothesis Validation: Navigating Biomedical Knowledge Bases via Explainable AI and Agentic Systems

Published on: June 13, 2025

772
A Nonsequencing Approach for the Rapid Detection of RNA Editing
08:50

A Nonsequencing Approach for the Rapid Detection of RNA Editing

Published on: April 21, 2022

2.7K

Area of Science:

  • Mathematical phylogenetics
  • Computational biology
  • Graph theory

Background:

  • Best match graphs (BMGs) represent gene relationships across species in phylogenetics.
  • BMGs are approximated using gene sequence similarity, often introducing errors.
  • Correcting these errors is crucial for accurate phylogenetic analysis.

Purpose of the Study:

  • To develop efficient heuristics for correcting errors in Best Match Graph data.
  • To address the NP-complete nature of arc set modification problems in BMGs.
  • To improve the practical application of BMGs in biological sequence data analysis.

Main Methods:

  • Heuristics operating on sets of rooted triples.
  • Top-down recursive algorithms linked to set partitioning problems.
  • Comparison with Aho's supertree algorithm for BMG editing consistency.
  • Benchmarking community detection algorithms for partitioning steps.

Main Results:

  • BMGs can be characterized by the consistency of rooted triples.
  • A connection to set partitioning yields recursive BMG editing algorithms.
  • Community detection algorithms demonstrate superior performance in BMG editing.
  • Developed algorithms correct noisy BMG data with high accuracy and efficiency.

Conclusions:

  • Noisy Best Match Graph data can be effectively corrected.
  • The developed methods offer accuracy and efficiency for BMG error correction.
  • BMGs are a viable and attractive alternative to traditional phylogenetic methods.