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

Mapping sequences by parts.

Gilles Didier1, Carito Guziolowski

  • 1Institut de Mathématiques de Luminy, 163 avenue de Luminy, Case 907, 13288 Marseille Cedex 9, France. didier@iml.univ-mrs.fr

Algorithms for Molecular Biology : AMB
|September 21, 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

Boolean Network Models of Human Preimplantation Development.

Journal of computational biology : a journal of computational molecular cell biology·2024
Same author

Testing extinction events and temporal shifts in diversification and fossilization rates through the skyline Fossilized Birth-Death (FBD) model: The example of some mid-Permian synapsid extinctions.

Cladistics : the international journal of the Willi Hennig Society·2024
Same author

Predicting weighted unobserved nodes in a regulatory network using answer set programming.

BMC bioinformatics·2023
Same author

The Cauchy Process on Phylogenies: A Tractable Model for Pulsed Evolution.

Systematic biology·2023
Same author

Editorial: Timetrees: Incorporating fossils and molecules.

Frontiers in genetics·2022
Same author

Distributions of extinction times from fossil ages and tree topologies: the example of mid-Permian synapsid extinctions.

PeerJ·2021
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

The N-map method compares sequences by accounting for evolutionary events like shuffling and reversal. This novel approach optimizes sequence alignment, revealing evolutionary relationships with enhanced accuracy.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Evolutionary Genetics

Background:

  • Traditional sequence comparison methods often fail to account for complex evolutionary events.
  • Shuffled, reversed, or repeated elements pose challenges in accurately comparing biological sequences.
  • A novel pairwise and asymmetrical approach is needed to address these limitations.

Purpose of the Study:

  • To introduce and evaluate the N-map method for sequence comparison.
  • To incorporate evolutionary events such as shuffling, reversal, and repetition into sequence analysis.
  • To determine the optimal number of partitions (N) for maximizing alignment scores.

Main Methods:

  • Developed an algorithm for computing the optimal N-map with O(|s| x |t| x N) time and memory complexity.

Related Experiment Videos

  • Selected the optimal N by evaluating the significance of N-map scores across a range of N values.
  • Analyzed empirical distributions of optimal N-map scores, approximating them with normal distributions.

    • Main Results:

    • The N-map algorithm efficiently computes optimal pairwise and asymmetrical sequence alignments.
    • Empirical distributions of optimal N-map scores demonstrate approximation by normal distributions.
    • The method's functionality was validated using random sequences with introduced artificial evolutionary events.

    Conclusions:

    • The N-map method effectively handles sequences with non-standard evolutionary events.
    • Case studies involving complex evolutionary scenarios illustrate the method's practical application.
    • This approach enhances the accuracy of sequence comparison in evolutionary studies.