4.7 Article

Comprehensive and relaxed search for oligonucleotide signatures in hierarchically clustered sequence datasets

期刊

BIOINFORMATICS
卷 27, 期 11, 页码 1546-1554

出版社

OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btr161

关键词

-

资金

  1. Bayerische Forschungsstiftung [AZ767-07]
  2. Deutsche Forschungsgemeinschaft [ENP GR 3688/1-1]

向作者/读者索取更多资源

Results: We have developed CaSSiS, a fast and scalable method for computing comprehensive collections of sequence- and sequence group-specific oligonucleotide signatures from large sets of hierarchically clustered nucleic acid sequence data. Based on the ARB Positional Tree (PT-)Server and a newly developed BGRT data structure, CaSSiS not only determines sequence-specific signatures and perfect group-covering signatures for every node within the cluster (i.e. target groups), but also signatures with maximal group coverage (sensitivity) within a user-defined range of non-target hits (specificity) for groups lacking a perfect common signature. An upper limit of tolerated mismatches within the target group, as well as the minimum number of mismatches with non-target sequences, can be predefined. Test runs with one of the largest phylogenetic gene sequence datasets available indicate good runtime and memory performance, and in silico spot tests have shown the usefulness of the resulting signature sequences as blueprints for group-specific oligonucleotide probes.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据