Jove
Visualize
联系我们
JoVE
x logofacebook logolinkedin logoyoutube logo
关于 JoVE
概览领导团队博客JoVE 帮助中心
作者
出版流程编辑委员会范围与政策同行评审常见问题投稿
图书馆员
用户评价订阅访问资源图书馆顾问委员会常见问题
研究
JoVE JournalMethods CollectionsJoVE Encyclopedia of Experiments存档
教育
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab Manual教师资源中心教师网站
使用条款与条件
隐私政策
政策

相关概念视频

Fixing Double-strand Breaks02:04

Fixing Double-strand Breaks

14.2K
The double-stranded structure of DNA has two major advantages. First, it serves as a safe repository of genetic information where one strand serves as the back-up in case the other strand is damaged. Second, the double-helical structure can be wrapped around proteins called histones to form nucleosomes, which can then be tightly wound to form chromosomes. This way, DNA chains up to 2 inches long can be contained within microscopic structures in a cell. A double-stranded break not only damages...
14.2K
Fixing Double-strand Breaks02:04

Fixing Double-strand Breaks

4.2K
4.2K
Long-patch Base Excision Repair01:02

Long-patch Base Excision Repair

7.8K
Since the discovery of the two BER pathways, there has been a debate about how a cell chooses one pathway over the other and the factors determining this selection. Numerous in vitro experiments have pointed out multiple determinants for the sub-pathway selection. These are:
7.8K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

437
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
437
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

12.5K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
12.5K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

1.1K
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
1.1K

您也可能阅读

相关文章

通过共同作者、期刊和引用图与本文相关的文章。

排序
Same author

CoCryoViS: Collaborative online cryo-electron tomography visualization system.

Protein science : a publication of the Protein Society·2026
Same author

RLBWT-based LCP computation in compressed space for terabase-scale pangenome analysis.

Bioinformatics (Oxford, England)·2026
Same author

Generation of Training Data to Distinguish Adverse Events from Medical Conditions.

Studies in health technology and informatics·2026
Same author

Book review of "digital media and the daily lives of China's senior citizens".

The Gerontologist·2026
Same author

Movi Color: fast and accurate taxonomic classification with the move structure.

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

Faster run-length compressed suffix arrays.

Oasics : openaccess series in informatics·2026

相关实验视频

Updated: Jan 8, 2026

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

530

KeBaB:基于k-mer的破解用于找到长MEMs.

Nathaniel K Brown1, Lore Depuydt2, Mohsen Zakeri1

  • 1Johns Hopkins University, Baltimore, USA.

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)
|December 15, 2025
PubMed
概括
此摘要是机器生成的。

使用Bloom过器的新型k-mer过方法KeBaB加速了基因组学中长最大精确匹配 (MEM) 的搜索. 这种技术通过有效过输入数据来增强序列对齐和元基因组分类.

关键词:
最多的精确匹配数量.伪MEMs是一种伪MEM.在 k-mer 过过程中,

更多相关视频

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.0K
DNA-based Fish Species Identification Protocol
09:15

DNA-based Fish Species Identification Protocol

Published on: April 28, 2010

30.1K

相关实验视频

Last Updated: Jan 8, 2026

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

530
A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

36.0K
DNA-based Fish Species Identification Protocol
09:15

DNA-based Fish Species Identification Protocol

Published on: April 28, 2010

30.1K

科学领域:

  • 生物信息学是一种生物信息学.
  • 计算生物学 计算生物学
  • 基因组学就是基因组学.

背景情况:

  • 最大精确匹配 (MEM) 对于基因组学任务至关重要,例如读取分类和序列对齐.
  • 现有的工具,如 ropebwt3,通过跳过冗余匹配步骤,有效地找到MEM.
  • 需要进一步优化,以加速这些计算密集型流程.

研究的目的:

  • 推出KeBaB,一种k-mer过方法,旨在提高MEM寻找算法的速度和效率.
  • 通过预先过输入数据来降低 ropebwt3 等工具的计算负载.
  • 提高元基因组分类的性能,而不会影响准确性.

主要方法:

  • 开发KeBaB,使用Bloom过器进行k-mer过步骤.
  • 整合KeBaB与现有的MEM探测器,如 ropebwt3.3.
  • 将输入序列分解为"伪MEM",以保证所有长MEM的封闭.

主要成果:

  • KeBaB显著加快了MEM查找算法,使他们能够忽略更大的输入数据部分.
  • 实验结果表明KeBaB能够加快元基因组分类的速度.
  • 该方法实现了加速度,而不会显著降低分类准确度.

结论:

  • 在基因组学中,KeBaB为k-mer过提供了一个快速且空间高效的解决方案.
  • 拟议的方法有效地提高了MEM寻找工具和下游应用程序 (如元基因组分类) 的性能.
  • KeBaB提供了一种灵活的方法,允许在最长的伪MEM中进行完整的MEM识别或有针对性的识别.