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

Mismatch Repair01:20

Mismatch Repair

5.4K
Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
5.4K
Mismatch Repair01:36

Mismatch Repair

38.1K
Overview
38.1K
Mismatch Repair01:36

Mismatch Repair

11.1K
11.1K
RNA-seq03:21

RNA-seq

9.4K
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...
9.4K
Sanger Sequencing01:57

Sanger Sequencing

800.8K
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...
800.8K
Next-generation Sequencing03:00

Next-generation Sequencing

87.9K
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....
87.9K

You might also read

Related Articles

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

Sort by
Same author

ORANGE: a machine learning approach for modeling tissue-specific aging from transcriptomic data.

Briefings in bioinformatics·2026
Same author

A universal indel filtering workflow for both long-read and short-read NGS data.

BMC research notes·2026
Same author

Quantifying pathological progression from single-cell transcriptomic data with scPSS.

Genome research·2026
Same author

Revisiting motif finding: do bi-objective metaheuristics surpass single-objective metaheuristics?

BMC bioinformatics·2025
Same author

GraphAge: Unleashing the power of graph neural network to decode epigenetic aging.

PNAS nexus·2025
Same author

PRIEST: predicting viral mutations with immune escape capability of SARS-CoV-2 using temporal evolutionary information.

Briefings in bioinformatics·2024

Related Experiment Video

Updated: May 1, 2026

Targeted DNA Methylation Analysis by Next-generation Sequencing
08:38

Targeted DNA Methylation Analysis by Next-generation Sequencing

Published on: February 24, 2015

38.3K

Indexing a sequence for mapping reads with a single mismatch.

Maxime Crochemore1, Alessio Langiu, M Sohel Rahman

  • 1Department of Informatics, King's College London, , London WC2R 2LS, UK.

Philosophical Transactions. Series A, Mathematical, Physical, and Engineering Sciences
|April 23, 2014
PubMed
Summary
This summary is machine-generated.

This study introduces efficient indexing for mapping DNA reads to genome sequences with one mismatch. The developed algorithm enables fast data structure construction and query processing for next-generation sequencing applications.

Keywords:
algorithmsgenome sequenceindexingmapping readsmismatchpattern matching

More Related Videos

Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

14.6K
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

16.5K

Related Experiment Videos

Last Updated: May 1, 2026

Targeted DNA Methylation Analysis by Next-generation Sequencing
08:38

Targeted DNA Methylation Analysis by Next-generation Sequencing

Published on: February 24, 2015

38.3K
Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

14.6K
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

16.5K

Area of Science:

  • Computational molecular biology
  • Bioinformatics
  • Genomics

Background:

  • Genome sequence analysis is crucial for molecular biology and bioinformatics.
  • Mapping short DNA reads to a reference genome is a fundamental challenge.
  • Next-generation sequencing generates vast amounts of data requiring efficient analysis tools.

Purpose of the Study:

  • To develop an efficient indexing strategy for mapping DNA reads with a single mismatch.
  • To address both simplified and general cases of sequence indexing for read mapping.
  • To provide a computationally efficient solution for next-generation sequencing data analysis.

Main Methods:

  • Algorithm development for sequence indexing.
  • Data structure construction with specified time and space complexity.
  • Query processing for read mapping with mismatches.

Main Results:

  • An efficient data structure is constructed in O(n log(1+ε) n) time and space.
  • Subsequent queries are answered in O(m log log n + K) time.
  • The algorithm handles both predefined and general pattern lengths for indexing.

Conclusions:

  • The proposed indexing method offers significant efficiency gains for read mapping.
  • This approach is well-suited for the demands of next-generation sequencing.
  • The developed algorithm provides a practical solution for analyzing genomic data with single mismatches.