Search research articles

Search research articles

Related Experiment Videos

A simulated annealing algorithm for finding consensus sequences.

Jonathan M Keith¹, Peter Adams, Darryn Bryant

¹Department of Mathematics, The University of Queensland, Qld 4072, Australia. jonathan@maths.uq.edu.au.

Bioinformatics (Oxford, England)

|November 9, 2002

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

HIRA-mediated H3.3 deposition preserves hepatocyte cell identity during liver aging.

Research square·2026

Same author

Distinct senescent β-cell senotypes differentially drive islet aging and dysfunction.

bioRxiv : the preprint server for biology·2026

Same author

Senescent cells secrete chromatin components via senescence-associated extracellular particles.

Research square·2026

Same author

Nucleosome stability safeguards cell identity, stress resilience and healthy aging.

Research square·2025

Same author

Mitochondrial metabolism and epigenetic crosstalk drive the SASP.

Research square·2024

Same author

University-based academic programs in addiction studies in the regions of Australia and Aotearoa New Zealand: An overview.

Drug and alcohol review·2024

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

Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026

See all related articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

This study introduces a novel algorithm for generating consensus sequences using simulated annealing. It bypasses multiple sequence alignment, directly optimizing sequence similarity for improved DNA sequencing applications.

Area of Science:

Bioinformatics
Computational Biology
Genomics

Background:

Consensus sequences represent common features within families of related DNA sequences.
They are crucial for various DNA sequencing applications and molecular characterization.

Purpose of the Study:

To develop a new algorithm for finding consensus sequences.
To improve upon conventional methods that rely on multiple sequence alignment.

Main Methods:

The algorithm employs simulated annealing, an optimization technique.
It directly minimizes the sum of pairwise distances to input sequences, bypassing traditional multiple sequence alignment.

Main Results:

The new algorithm generates high-quality consensus sequences and alignments.

Related Experiment Videos

Its computational time scales linearly with sequence number and quadratically with consensus length.

Performance comparisons show the algorithm outperforms ClustalW in many cases.

Conclusions:

This simulated annealing-based approach offers an efficient and effective method for consensus sequence determination.
The algorithm provides a valuable alternative to traditional multiple sequence alignment-based methods.