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

Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Sanger Sequencing01:57

Sanger Sequencing

DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...
RNA-seq03:21

RNA-seq

RNA sequencing, or RNA-Seq, is a high-throughput sequencing technology used to study the transcriptome of a cell. Transcriptomics helps to interpret the functional elements of a genome and identify the molecular constituents of an organism. Additionally, it also helps in understanding the development of an organism and the occurrence of diseases. 
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while microarray-based...
Next-generation Sequencing03:00

Next-generation Sequencing

The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features.

You might also read

Related Articles

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

Sort by
Same author

Influence of Live Music and Tasting Assessment on Hedonic and Emotional Responses of Wine in Public Tasting Events.

Foods (Basel, Switzerland)·2026
Same author

Wearable sensors to measure the influence of sonic seasoning on wine consumers in a live context: a preliminary proof-of-concept study.

Journal of the science of food and agriculture·2024
Same author

An overview of bioinformatics courses delivered at the academic level in Italy: Reflections and recommendations from BITS.

PLoS computational biology·2023
Same author

Wearable Sensors for Assessing the Role of Olfactory Training on the Autonomic Response to Olfactory Stimulation.

Sensors (Basel, Switzerland)·2021
Same author

A yeast living ancestor reveals the origin of genomic introgressions.

Nature·2020
Same author

Do protocells preferentially retain macromolecular solutes upon division/fragmentation? A study based on the extrusion of POPC giant vesicles.

Integrative biology : quantitative biosciences from nano to macro·2017

Related Experiment Video

Updated: May 24, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

BpMatch: an efficient algorithm for a segmental analysis of genomic sequences.

Claudio Felicioli1, Roberto Marangoni

  • 1Noname Research, via dell’Ozeretto 3, Pisa 56100, Italy. pangon@gmail.com

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|February 22, 2012
PubMed
Summary
This summary is machine-generated.

BpMatch is a novel algorithm for fast sequence coverage analysis. It identifies significant segments and their repeats, offering efficient computation for biological sequence comparison.

More Related Videos

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

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Related Experiment Videos

Last Updated: May 24, 2026

Novel Sequence Discovery by Subtractive Genomics
09:40

Novel Sequence Discovery by Subtractive Genomics

Published on: January 25, 2019

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

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Sequence analysis is crucial in bioinformatics.
  • Existing methods may lack efficiency or flexibility in handling complex sequence relationships.
  • Identifying significant repeating segments is key for understanding sequence function and structure.

Purpose of the Study:

  • To introduce BpMatch, an efficient algorithm for sequence coverage computation.
  • To enable the identification of significant direct and reverse sequence segments.
  • To provide a tool for self-covering analysis and spectral representation of sequence repeats.

Main Methods:

  • Development of the BpMatch algorithm utilizing a modified suffix-tree data structure.
  • Implementation of parameters for minimum segment length (l) and minimum occurrences (minRep) to define significance.
  • Computation of sequence coverage considering direct, reverse, and overlapped segments.

Main Results:

  • BpMatch achieves efficient coverage computation, with average time complexity of O(n) under specific conditions.
  • The algorithm successfully identifies significant segments based on user-defined length and occurrence thresholds.
  • Self-covering analysis using BpMatch generates a spectral representation of sequence repeats, avoiding trivial solutions.

Conclusions:

  • BpMatch offers a fast and efficient solution for sequence coverage and repeat analysis.
  • The algorithm's flexibility in parameter setting allows for tailored analysis of biological sequences.
  • BpMatch provides valuable insights into sequence structure through spectral representation of repeats.