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

Genomic sorting with length-weighted reversals.

Ron Y Pinter1, Steven Skiena

  • 1Department of Computer Science, Technion--Israel Institute of Technology, Haifa 32000, Israel. pinter@cs.technion.ac.il

Genome Informatics. International Conference on Genome Informatics
|October 23, 2003
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

Statistical structure and the evolution of languages.

Proceedings. Biological sciences·2026
Same author

Statistical Methodology for Ribosomal Frameshift Detection.

ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine·2025
Same author

American public opinion on artificial intelligence in healthcare.

PloS one·2023
Same author

Quantifying Healthy Aging in Older Veterans Using Computational Audio Analysis.

The journals of gerontology. Series A, Biological sciences and medical sciences·2023
Same author

Explainable automated evaluation of the clock drawing task for memory impairment screening.

Alzheimer's & dementia (Amsterdam, Netherlands)·2023
Same author

Diet modulates brain network stability, a biomarker for brain aging, in young adults.

Proceedings of the National Academy of Sciences of the United States of America·2020
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 genome rearrangement model that considers reversal lengths, not just counts. An efficient algorithm offers approximation results for sorting unsigned permutations, improving bioinformatic insights.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Current genome rearrangement algorithms overlook the length of reversals, focusing solely on their quantity.
  • This limitation restricts the accurate modeling of mutation phenomena in genomic studies.

Purpose of the Study:

  • To introduce a novel cost model for genome rearrangement that incorporates the length of reversals.
  • To develop and analyze an efficient approximation algorithm for sorting unsigned permutations under this new model.

Main Methods:

  • Development of a new cost model where the length of reversed sequences influences the cost.
  • Design and analysis of an efficient algorithm for sorting unsigned permutations using length as an optimization criterion.

Main Results:

Related Experiment Videos

  • An upper bound of O(fn lg2n) for sorting any n-element permutation with an additive cost measure f.
  • A guaranteed approximation ratio of O(lg2n) times the optimal solution for sorting a given permutation.

Conclusions:

  • The new model provides greater flexibility in accounting for mutation phenomena in genome rearrangements.
  • The proposed algorithm offers significant improvements in approximation ratios for sorting unsigned permutations, with implications for bioinformatics.