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

相关概念视频

Ranks01:02

Ranks

236
Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...
236
Sign Test for Matched Pairs01:17

Sign Test for Matched Pairs

131
The sign test for matched pairs offers a robust method for comparing two paired samples, often for the effects of an intervention in one of them. This method is very useful in situations where the underlying distribution of the data is unknown. The test compares two related samples—often pre- and post-treatment measurements on the same subjects—to determine if there are significant differences in their median values.
To conduct the sign test, we first calculate the differences in...
131
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.6K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.6K
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

123
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...
123
Signal Sequences and Sorting Receptors01:41

Signal Sequences and Sorting Receptors

5.4K
Signal sequences are short amino acid sequences that guide newly synthesized proteins to their proper location within the cell. Classical signal sequences are fifteen to sixty amino acids long and present at the N-terminus of a polypeptide chain. Each signal sequence has a conserved segment of basic residues towards their N terminus, a hydrophobic core, and a C-terminus rich in polar residues. The C-terminus also contains a signal cleavage site and features a -3 -1 sequence motif. The -3-1...
5.4K
Sieve Analysis and Grading Curves01:19

Sieve Analysis and Grading Curves

352
Sieve analysis is a method used to determine the particle size distribution of aggregate materials. This process involves the following steps:
352

您也可能阅读

相关文章

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

排序
Same author

Prefix-free parsing for merging big BWTs.

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)·2025
Same author

r-indexing the eBWT.

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)·2024
Same author

Computing the original eBWT faster, simpler, and with less memory.

International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)·2024
Same author

On Infinite Prefix Normal Words.

Theoretical computer science·2021
Same author

Data structures based on <i>k</i>-mers for querying large collections of sequencing data sets.

Genome research·2020
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
查看所有相关文章

相关实验视频

Updated: Jul 1, 2025

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.1K

通过匹配统计数据对后进行排序.

Zsuzsanna Lipták1, Francesco Masillo1, Simon J Puglisi2,3

  • 1Department of Computer Science, University of Verona, Verona, Italy.

Algorithms for molecular biology : AMB
|March 13, 2024
PubMed
概括
此摘要是机器生成的。

我们开发了一种新的算法,用于在类似的字符串集合中生成泛化后数组. 这种方法有效地构建后数组,优于特定数据类型的现有技术.

关键词:
压缩表示表示 压缩表示数据结构数据结构.有效的算法高效的算法.一般化后数组是一般化的后数组.匹配统计数据的统计.字符串集合 字符串集合

更多相关视频

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter
07:37

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter

Published on: February 13, 2014

11.0K
Step-specific Sorting of Mouse Spermatids by Flow Cytometry
06:31

Step-specific Sorting of Mouse Spermatids by Flow Cytometry

Published on: December 31, 2015

10.6K

相关实验视频

Last Updated: Jul 1, 2025

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'
10:31

A Visual Guide to Sorting Electrophysiological Recordings Using 'SpikeSorter'

Published on: February 10, 2017

11.1K
Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter
07:37

Sorting of Streptomyces Cell Pellets Using a Complex Object Parametric Analyzer and Sorter

Published on: February 13, 2014

11.0K
Step-specific Sorting of Mouse Spermatids by Flow Cytometry
06:31

Step-specific Sorting of Mouse Spermatids by Flow Cytometry

Published on: December 31, 2015

10.6K

科学领域:

  • 生物信息学是一种生物信息学.
  • 计算生物学 计算生物学
  • 字符串算法 字符串算法

背景情况:

  • 一般化后数组对于分析大型生物序列数据至关重要.
  • 现有的方法与非常相似的字符串集合作斗争,导致效率低下.
  • 对生物信息学研究来说,一般化后数组的高效构建至关重要.

研究的目的:

  • 引入一种新的,高效的算法,用于构建通用后数组.
  • 为了应对处理非常相似的字符串集合的挑战.
  • 为了提高特定数据集的后数组构建的速度和性能.

主要方法:

  • 构建与参考字符串相匹配的统计数据的压缩表示.
  • 使用此数据结构创建后的部分顺序.
  • 采用部分顺序来加速后比较,用于最终的概括后数组构建.
  • 开发一种用于快速计算两个字符串之间的匹配统计数据的启发式.

主要成果:

  • 拟议的算法证明了与非常相似的字符串集合的现有方法相比,具有竞争力或优越的构建时间.
  • 使用sacamats工具的实验结果验证了算法的效率.
  • 匹配统计计算的启发式显示出独立应用的潜力.

结论:

  • 新的算法为类似的字符串集合提供了一般化后数组构建的显著进步.
  • 这种方法为特定的生物信息学应用提供了更快,更有效的替代方案.
  • 该sacamats工具是拟议的算法的实际实现.