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

Optimally separating sequences.

G Myers1

  • 1Informatics Research, Celera Genomics, 45 W. Gude Dr., Rockville, MD 20850, USA. Gene.Myers@celera.com

Genome Informatics. International Conference on Genome Informatics
|January 16, 2002
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

Evidence for the Collective Nature of Radial Flow in Pb+Pb Collisions with the ATLAS Detector.

Physical review letters·2026
Same author

Evidence for the Dimuon Decay of the Higgs Boson in pp Collisions with the ATLAS Detector.

Physical review letters·2025
Same author

A novel glucose beta-hydroxybutyrate combination improves hypoglycaemia recovery and patient-reported outcomes in type 1 diabetes.

Diabetes, obesity & metabolism·2025
Same author

Evidence for Longitudinally Polarized W Bosons in the Electroweak Production of Same-Sign W Boson Pairs in Association with Two Jets in pp Collisions at sqrt[s]=13  TeV with the ATLAS Detector.

Physical review letters·2025
Same author

Observation of tt[over ¯] Production in Pb+Pb Collisions at sqrt[s_{NN}]=5.02  TeV with the ATLAS Detector.

Physical review letters·2025
Same author

Search for Dark Matter Produced in Association with a Dark Higgs Boson in the bb[over ¯] Final State Using pp Collisions at sqrt[s]=13  TeV with the ATLAS Detector.

Physical review letters·2025
Same journal

Linear regression models predicting strength of transcriptional activity of promoters.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Sign: large-scale gene network estimation environment for high performance computing.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Docking-calculation-based method for predicting protein-RNA interactions.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Mechanism of cell cycle disruption by multiple p53 pulses.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Database for crude drugs and Kampo medicine.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.

Genome informatics. International Conference on Genome Informatics·2011
See all related articles

This study introduces a new metric and algorithms for separating similar biological sequences into distinct classes. The methods effectively distinguish sequence groups, improving alignment analysis.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Sequence Analysis

Background:

  • Multi-aligned biological sequences present challenges in class separation.
  • Existing methods may struggle with distinguishing similar sequence classes.
  • Optimal multi-alignment is crucial for accurate downstream analysis.

Purpose of the Study:

  • To develop a novel objective function for separating two distinct classes of k similar sequences.
  • To introduce efficient algorithms for solving the sequence class separation problem.
  • To evaluate the effectiveness of the proposed metric and algorithms through empirical trials.

Main Methods:

  • Introduced an objective function minimizing the consensus score of separated sequence halves.
  • Developed an O(k3n) heuristic algorithm for sequence class separation.

Related Experiment Videos

  • Implemented two optimal branch-and-bound algorithms with progressively powerful lower bounds for search tree pruning.

    • Main Results:

    • The branch-and-bound algorithms demonstrated effective pruning of the O(2k) search space.
    • A simpler lower bound evaluated in O(n) time, while a stronger bound took O((k+s)n) time.
    • Empirical trials validated the degree of class separability using the proposed metric.

    Conclusions:

    • The developed metric and algorithms provide an effective means for separating distinct classes of similar sequences.
    • The branch-and-bound algorithms show significant pruning efficiency, making the approach computationally feasible.
    • This work advances sequence analysis by offering improved methods for class discrimination in multi-aligned datasets.