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

Conservative Site-specific Recombination and Phase Variation02:53

Conservative Site-specific Recombination and Phase Variation

Because the DNA segments are cut and reorganized in a direction-specific manner, site-specific recombination has emerged as an efficient genetic engineering technique. Flippase and Cyclization recombinases or Flp and Cre, respectively, are two members of the tyrosine recombinase family derived from bacteriophages, that are used to mediate site-specific DNA insertions, deletions, and targeted expression of proteins in mammalian cell lines.
The recognition sites for Cre recombinase called LoxP...

You might also read

Related Articles

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

Sort by
Same author

A Theoretical Characterization of the Good Properties of Extremely Randomized Trees for Random Forest-Distance Computation.

IEEE transactions on pattern analysis and machine intelligenceยท2026
Same author

Entropic Bounds on the Average Length of Codes with a Space.

Entropy (Basel, Switzerland)ยท2024
Same author

On Infinite Prefix Normal Words.

Theoretical computer scienceยท2021
See all related articles

Related Experiment Video

Updated: Jul 9, 2026

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

Optimal group testing algorithms with interval queries and their application to splice site detection.

Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro

    International Journal of Bioinformatics Research and Applications
    |December 1, 2007
    PubMed
    Summary

    This study introduces efficient Interval Group Testing algorithms to identify unknown gene subsets. The research provides tight bounds for two-stage strategies and results for multi-stage testing, minimizing queries for splice site detection.

    More Related Videos

    Using RNA-sequencing to Detect Novel Splice Variants Related to Drug Resistance in In Vitro Cancer Models
    09:58

    Using RNA-sequencing to Detect Novel Splice Variants Related to Drug Resistance in In Vitro Cancer Models

    Published on: December 9, 2016

    Related Experiment Videos

    Last Updated: Jul 9, 2026

    Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
    14:06

    Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

    Published on: June 23, 2012

    Using RNA-sequencing to Detect Novel Splice Variants Related to Drug Resistance in In Vitro Cancer Models
    09:58

    Using RNA-sequencing to Detect Novel Splice Variants Related to Drug Resistance in In Vitro Cancer Models

    Published on: December 9, 2016

    Area of Science:

    • Computational Biology
    • Bioinformatics
    • Algorithm Design

    Background:

    • Identifying specific elements within a larger set is crucial in biological research.
    • Splice site detection in genes requires efficient methods for locating positive elements.
    • Existing methods may not be optimal for identifying consecutive subsets.

    Purpose of the Study:

    • To develop and analyze algorithms for the Interval Group Testing problem.
    • To minimize the number of queries needed to identify an unknown subset P of positive elements.
    • To apply these algorithms to the biological challenge of splice site detection.

    Main Methods:

    • Investigating algorithms for Interval Group Testing with consecutive element queries.
    • Analyzing strategies involving multiple stages where queries are performed in parallel.
    • Deriving tight bounds for two-stage algorithms.
    • Extending results to strategies with an arbitrary number of stages and positive elements.

    Main Results:

    • Developed efficient algorithms for Interval Group Testing.
    • Established tight performance bounds for two-stage testing strategies.
    • Provided theoretical results applicable to multi-stage testing scenarios.
    • Demonstrated the relevance of the problem to splice site detection.

    Conclusions:

    • The proposed Interval Group Testing algorithms offer an efficient approach to identifying unknown subsets.
    • The derived bounds provide theoretical guarantees for the performance of two-stage strategies.
    • The research contributes to optimizing methods for biological sequence analysis, specifically splice site detection.