Search research articles

关于 JoVE

概览领导团队博客 JoVE 帮助中心

作者

出版流程编辑委员会范围与政策同行评审常见问题投稿

图书馆员

用户评价订阅访问资源图书馆顾问委员会常见问题

研究

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments 存档

教育

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual 教师资源中心教师网站

使用条款与条件

相关概念视频

Adjusting a Traverse

Adjusting a Traverse

In the site survey of a four-sided traverse, internal angles are essential to ensure geometric accuracy. The survey revealed that the sum of the measured internal angles was 359 degrees and 48 minutes, which is 12 minutes less than the expected 360 degrees. This discrepancy signals an error likely arising from measurement inaccuracies during the fieldwork.To rectify this error, the adjustment process involved distributing the 12-minute shortfall equally across the four internal angles. By...

您也可能阅读

相关文章

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

排序

Same author

Hash functions in nucleotide sequence analysis.

Genome research·2026

Same author

Estimation of substitution and indel rates via <i>k</i>-mer statistics.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2026

Same author

A k-mer-Based Estimator of the Substitution Rate Between Repetitive Sequences.

Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop)·2026

Same author

Efficiency of Learned Indexes on Genome Spectra.

LIPIcs : Leibniz international proceedings in informatics·2026

Same author

The gift of novelty: repeat-robust <i>k</i>-mer-based estimators of mutation rates.

bioRxiv : the preprint server for biology·2026

Same author

Data Structures to Represent a Set of <math><mi>k</mi></math> -long DNA Sequences.

ACM computing surveys·2026

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

查看所有相关文章

Search research articles

相关实验视频

Updated: Jun 27, 2025

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

ESKEMAP:基于精确草图的读取映射.

Tizian Schulz^1,2,3, Paul Medvedev^4,5,6

¹Faculty of Technology and Center for Biotechnology (CeBiTec), Bielefeld University, Bielefeld, Germany. tizian.schulz@uni-bielefeld.de.

Algorithms for molecular biology : AMB

|May 4, 2024

概括

此摘要是机器生成的。

本研究介绍了基于素描的读取映射的精确算法,找到所有相似度值以上的基因组位置. 这种新方法提高了回忆力,与minimap2.2等现有工具相比.

关键词:

动态编程是一种动态编程.精确的算法精确的算法.长时间读取映射绘制.序列素描序列素描序列素描

更多相关视频

Targeted DNA Methylation Analysis by Next-generation Sequencing

Targeted DNA Methylation Analysis by Next-generation Sequencing

Published on: February 24, 2015

Mapping RNA-RNA Interactions Globally Using Biotinylated Psoralen

Mapping RNA-RNA Interactions Globally Using Biotinylated Psoralen

Published on: May 24, 2017

相关实验视频

Last Updated: Jun 27, 2025

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

High-Throughput Analysis of Optical Mapping Data Using ElectroMap

Published on: June 4, 2019

Targeted DNA Methylation Analysis by Next-generation Sequencing

Targeted DNA Methylation Analysis by Next-generation Sequencing

Published on: February 24, 2015

Mapping RNA-RNA Interactions Globally Using Biotinylated Psoralen

Mapping RNA-RNA Interactions Globally Using Biotinylated Psoralen

Published on: May 24, 2017

科学领域:

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

背景情况:

读取映射识别了测序读取和参考基因组之间的类似序列.
传统的映射器使用对齐分数;基于草图的映射器缺乏精确的问题制定.
现有的基于素描的方法无法找到所有超出相似度值的映射位置.

研究的目的:

为了在序列素描层面上制定读取映射的问题.
开发一个精确的算法,以草图为基础的读取映射.
为了找到所有可能的映射位置,读数高于指定的相似度得分.

主要方法:

使用序列草图来制定读取映射.
开发一个精确的动态编程算法.
在k-mers和草图属性方面具有时间和空间复杂性的算法分析.

主要成果:

一个精确的算法发现了所有超过相似度值的映射匹配.
算法运行在O ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((
在将长读数映射到人类Y染色体时,该算法以同等精度实现了0.88回忆,而minimap2的0.76.

结论:

开发的算法精确地解决了基于素描的读取映射.
这种方法成功地识别了所有重要的映射位置,在回忆中表现优于现有的工具.
这种方法对于复杂的基因组区域,如片序列,特别有价值.