Algorithms for Molecular Biology最新文献_第4页

Embedding gene trees into phylogenetic networks by conflict resolution algorithms 通过冲突解决算法将基因树嵌入系统发育网络

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2022-05-19 DOI: 10.1186/s13015-022-00218-8

Marcin Wawerka, D. Dabkowski, Natalia Rutecka, Agnieszka Mykowiecka, P. Górecki

引用次数: 2

Bi-alignments with affine gaps costs 具有仿射间隙的双对齐代价

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2022-05-16 DOI: 10.1186/s13015-022-00219-7

Peter F. Stadler, S. Will

引用次数: 1

Adding hydrogen atoms to molecular models via fragment superimposition 通过片段叠加将氢原子添加到分子模型中

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2022-03-29 DOI: 10.1186/s13015-022-00215-x

Patrick Kunzmann, Jacob Marcel Anter, K. Hamacher

引用次数: 2

Parsimonious Clone Tree Integration in cancer 癌症中的简约克隆树整合

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2022-03-14 DOI: 10.1186/s13015-022-00209-9

P. Sashittal, Simone Zaccaria, M. El-Kebir

引用次数: 5

Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics 树的饮食:减少树的宽度解锁RNA生物信息学中的FPT算法

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2021-05-04 DOI: 10.1186/s13015-022-00213-z

Bertrand Marchand, Y. Ponty, L. Bulteau

引用次数: 1

Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics. 带相似性矩阵的邻接约束层次聚类及其在基因组学中的应用。

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2019-11-15 eCollection Date: 2019-01-01 DOI: 10.1186/s13015-019-0157-4

Christophe Ambroise, Alia Dehman, Pierre Neuvial, Guillem Rigaill, Nathalie Vialaneix

{"title":"Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics.","authors":"Christophe Ambroise, Alia Dehman, Pierre Neuvial, Guillem Rigaill, Nathalie Vialaneix","doi":"10.1186/s13015-019-0157-4","DOIUrl":"https://doi.org/10.1186/s13015-019-0157-4","url":null,"abstract":"Background: Genomic data analyses such as Genome-Wide Association Studies (GWAS) or Hi-C studies are often faced with the problem of partitioning chromosomes into successive regions based on a similarity matrix of high-resolution, locus-level measurements. An intuitive way of doing this is to perform a modified Hierarchical Agglomerative Clustering (HAC), where only adjacent clusters (according to the ordering of positions within a chromosome) are allowed to be merged. But a major practical drawback of this method is its quadratic time and space complexity in the number of loci, which is typically of the order of <math><msup><mn>10</mn> <mn>4</mn></msup> </math> to <math><msup><mn>10</mn> <mn>5</mn></msup> </math> for each chromosome.Results: By assuming that the similarity between physically distant objects is negligible, we are able to propose an implementation of adjacency-constrained HAC with quasi-linear complexity. This is achieved by pre-calculating specific sums of similarities, and storing candidate fusions in a min-heap. Our illustrations on GWAS and Hi-C datasets demonstrate the relevance of this assumption, and show that this method highlights biologically meaningful signals. Thanks to its small time and memory footprint, the method can be run on a standard laptop in minutes or even seconds.Availability and implementation: Software and sample data are available as an R package, adjclust, that can be downloaded from the Comprehensive R Archive Network (CRAN).","PeriodicalId":50823,"journal":{"name":"Algorithms for Molecular Biology","volume":"14 ","pages":"22"},"PeriodicalIF":1.0,"publicationDate":"2019-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13015-019-0157-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49684571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"生物学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 21

Using a constraint-based regression method for relative quantification of somatic mutations in pyrosequencing signals: a case for NRAS analysis 使用基于约束的回归方法对焦磷酸测序信号中的体细胞突变进行相对量化:NRAS分析的一个案例

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2016-09-15 DOI: 10.1186/s13015-016-0086-4

J. Ambroise, Jamal Badir, Louise Nienhaus, Annie Robert, A. Dekairelle, J. Gala

引用次数: 1

The paralog-to-contig assignment problem: high quality gene models from fragmented assemblies 从片段组合中提取高质量的基因模型

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2016-02-24 DOI: 10.1186/s13015-016-0063-y

H. Indrischek, Nicolas Wieseke, Peter F. Stadler, Sonja J. Prohaska

引用次数: 25

HIA: a genome mapper using hybrid index-based sequence alignment HIA:使用杂交索引为基础的序列比对的基因组图谱绘制者

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2015-12-01 DOI: 10.1186/s13015-015-0062-4

Jongpill Choi, Kiejung Park, S. Cho, Myungguen Chung

引用次数: 3

Interpretation and approximation tools for big, dense Markov chain transition matrices in population genetics 解释和近似工具的大，密集的马尔可夫链转移矩阵在群体遗传学

IF 1 4区生物学

Algorithms for Molecular Biology Pub Date : 2015-12-01 DOI: 10.1186/s13015-015-0061-5

Katja Reichel, Valentin Bahier, C. Midoux, N. Parisey, J. Masson, S. Stoeckel

引用次数: 8