標(biāo)題: Titlebook: Algorithms in Bioinformatics; 15th International W Mihai Pop,Hélène Touzet Conference proceedings 2015 Springer-Verlag Berlin Heidelberg 20 [打印本頁] 作者: MAXIM 時(shí)間: 2025-3-21 18:16
書目名稱Algorithms in Bioinformatics影響因子(影響力)
書目名稱Algorithms in Bioinformatics影響因子(影響力)學(xué)科排名
書目名稱Algorithms in Bioinformatics網(wǎng)絡(luò)公開度
書目名稱Algorithms in Bioinformatics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms in Bioinformatics被引頻次
書目名稱Algorithms in Bioinformatics被引頻次學(xué)科排名
書目名稱Algorithms in Bioinformatics年度引用
書目名稱Algorithms in Bioinformatics年度引用學(xué)科排名
書目名稱Algorithms in Bioinformatics讀者反饋
書目名稱Algorithms in Bioinformatics讀者反饋學(xué)科排名
作者: 錯(cuò) 時(shí)間: 2025-3-21 23:37 作者: initiate 時(shí)間: 2025-3-22 03:44 作者: OTTER 時(shí)間: 2025-3-22 08:12
A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Seonary trees. Our theoretical results are then validated using a combination of synthetic and biological data with our proposed model shown to save almost . space while finishing in half the time compared to existing methodologies.作者: Vasodilation 時(shí)間: 2025-3-22 12:41
Maximum Parsimony Analysis of Gene Copy Number Changes,or large datasets. In this paper we design a new algorithm for the RSMT problem, based on Maximum Parsimony phylogeny inference. Experimental results from both simulated and real tumor data show that our approach outperforms previous heuristics for the RSMT problem, thus obtaining better models for 作者: 允許 時(shí)間: 2025-3-22 15:05
Multiple-Ancestor Localization for Recently Admixed Individuals,tions integrated into a two-layered Hidden Markov Model, designed to capture both long-range correlations between SNPs due to the recent mixing and short-range correlations due to linkage disequilibrium. We evaluate the method on both simulated and real European data, and demonstrate that it achieve作者: zonules 時(shí)間: 2025-3-22 19:23 作者: Lacerate 時(shí)間: 2025-3-23 00:38 作者: 不可知論 時(shí)間: 2025-3-23 03:53
Sparse RNA Folding Revisited: Space-Efficient Minimum Free Energy Prediction,s. Then, we present the time- and space-efficient sparsified free energy minimization algorithm ., which guarantees optimal structure prediction. In particular, this novel algorithm provides efficient fold reconstruction based on dynamically garbage collected trace arrows. We provide theoretical and作者: 外露 時(shí)間: 2025-3-23 08:32
https://doi.org/10.1007/978-3-658-05889-0onstant, symmetric and plaid biclustering models. Second, we propose a solution to discover these flexible modules without time and memory bottlenecks by seizing high efficiency gains from the inherent structural sparsity of networks. Results from the analysis of protein and gene interaction network作者: 努力趕上 時(shí)間: 2025-3-23 10:01 作者: LARK 時(shí)間: 2025-3-23 14:21 作者: Receive 時(shí)間: 2025-3-23 20:12 作者: fetter 時(shí)間: 2025-3-23 23:20 作者: 密切關(guān)系 時(shí)間: 2025-3-24 05:20 作者: objection 時(shí)間: 2025-3-24 08:11 作者: 反復(fù)拉緊 時(shí)間: 2025-3-24 12:35
Der Bildungsroman im 20. Jahrhundert,ring/orientation under the prefix match criteria. Further, through experiments on a number of data sets, we demonstrate that this heuristic works well in practice. A prototype implementation of this 2-factor approximation is available at ..作者: Contend 時(shí)間: 2025-3-24 16:54 作者: Cryptic 時(shí)間: 2025-3-24 19:09 作者: enhance 時(shí)間: 2025-3-25 02:33 作者: 小隔間 時(shí)間: 2025-3-25 04:30
https://doi.org/10.1007/978-3-322-90771-4, by introducing a discrete optimization problem, called the .. We show that it can be efficiently solved on realistic-size simulated CH-data by using integer linear programming (ILP). The empirical results strongly validate this approach.作者: 制定法律 時(shí)間: 2025-3-25 10:46 作者: narcotic 時(shí)間: 2025-3-25 14:53
https://doi.org/10.1007/978-3-476-03918-7 to incorporate approximate matching, namely the longest and the average common substring with . mismatches. Our approach is exact, and it is based on a filtering technique that showed, in a set of preliminary experiments, to substantially reduce the size of the set of potential sites of a longest match.作者: mediocrity 時(shí)間: 2025-3-25 19:51
Die Nachkriegszeit (Westeuropa), a minimum weight double cut and join (DCJ) scenario among all minimum length scenarios. In the process, we solve an optimization problem on colored noncrossing partitions which is a generalization of the . problem on circle graphs.作者: GLADE 時(shí)間: 2025-3-25 21:22 作者: Injunction 時(shí)間: 2025-3-26 02:53
Orthology Relation and Gene Tree Correction: Complexity Results,o minimally correct a gene tree in order to fit the set of relations? In this paper, various objective functions are considered for the minimality criterion, among them the Robinson-Foulds distance between the initial and corrected gene tree. All considered problem variants are shown to be NP-complete.作者: START 時(shí)間: 2025-3-26 05:04
Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programm, by introducing a discrete optimization problem, called the .. We show that it can be efficiently solved on realistic-size simulated CH-data by using integer linear programming (ILP). The empirical results strongly validate this approach.作者: Aspiration 時(shí)間: 2025-3-26 08:54
Semi-nonparametric Modeling of Topological Domain Formation from Epigenetic Data, inferring TADs using our trained model, we are able to predict TADs across different species and cell types, without the use of Hi-C data, suggesting their effect is conserved. This work provides the first comprehensive joint model of the effect histone markers on domain formation.作者: 保留 時(shí)間: 2025-3-26 15:20 作者: 得意人 時(shí)間: 2025-3-26 19:18 作者: Ornament 時(shí)間: 2025-3-27 00:25 作者: 嘲笑 時(shí)間: 2025-3-27 01:26
,Rundtischgespr?ch und Podiumsdiskussion,-hard, by providing a different proof. We also prove NP-completeness of a variant of this problem proposed in the same paper. On the positive side, we obtain a polynomial time algorithm for matrix instances in which no column is contained in both columns of a pair of conflicting columns.作者: Induction 時(shí)間: 2025-3-27 08:39 作者: 合并 時(shí)間: 2025-3-27 12:47
Der Bildungsroman im 20. Jahrhundert, and show how it can be computed efficiently for circular sequence comparison. Experimental results, using real and synthetic data, demonstrate orders-of-magnitude superiority of our approach in terms of efficiency, while maintaining an accuracy very competitive to the state of the art.作者: 說不出 時(shí)間: 2025-3-27 16:34
https://doi.org/10.1007/978-3-476-03918-7t-free, reference-free and incremental data structure for storing a pan-genome as a C-DBG: the Bloom Filter Trie. The data structure allows to store and compress a set of colored .-mers, and also to efficiently traverse the graph. Experimental results prove better performance compared to another state-of-the-art data structure.作者: 刪除 時(shí)間: 2025-3-27 19:06
Finding a Perfect Phylogeny from Mixed Tumor Samples,-hard, by providing a different proof. We also prove NP-completeness of a variant of this problem proposed in the same paper. On the positive side, we obtain a polynomial time algorithm for matrix instances in which no column is contained in both columns of a pair of conflicting columns.作者: 形狀 時(shí)間: 2025-3-27 22:55
Scrible: Ultra-Accurate Error-Correction of Pooled Sequenced Reads,ate that our method has much higher accuracy in correcting short reads compared to state-of-the-art error-correcting methods. On real data on the barley genome we show that . significantly improves the decoding accuracy of short reads to individual BACs.作者: 蝕刻 時(shí)間: 2025-3-28 03:49
Circular Sequence Comparison with ,-grams, and show how it can be computed efficiently for circular sequence comparison. Experimental results, using real and synthetic data, demonstrate orders-of-magnitude superiority of our approach in terms of efficiency, while maintaining an accuracy very competitive to the state of the art.作者: 動(dòng)機(jī) 時(shí)間: 2025-3-28 08:39
,Bloom Filter Trie – A Data Structure for Pan-Genome Storage,t-free, reference-free and incremental data structure for storing a pan-genome as a C-DBG: the Bloom Filter Trie. The data structure allows to store and compress a set of colored .-mers, and also to efficiently traverse the graph. Experimental results prove better performance compared to another state-of-the-art data structure.作者: concert 時(shí)間: 2025-3-28 13:40
0302-9743 The selected papers cover a wide range of topics from networks to phylogenetic studies, sequence and genome analysis, comparative genomics, and RNA structure.978-3-662-48220-9978-3-662-48221-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Perceive 時(shí)間: 2025-3-28 16:07
0302-9743 matics, WABI 2015, held in Atlanta, GA, USA, in September 2015. The 23 full papers presented were carefully reviewed and selected from 56 submissions. The selected papers cover a wide range of topics from networks to phylogenetic studies, sequence and genome analysis, comparative genomics, and RNA s作者: 爭吵加 時(shí)間: 2025-3-28 18:47
BicNET: Efficient Biclustering of Biological Networks to Unravel Non-Trivial Modules,nding the cell behavior, dense biclusters can only identify modules where genes, proteins or metabolites are strongly connected. These modules are thus often associated with trivial, already known interactions or background processes not necessarily related with the studied conditions. Furthermore, 作者: triptans 時(shí)間: 2025-3-29 01:07
Simultaneous Optimization of both Node and Edge Conservation in Network Alignment via WAVE,ion (NCF) to compare nodes across networks and an alignment strategy (AS) to find high-scoring alignments with respect to total NCF over all aligned nodes (or node conservation). Then, they evaluate alignments via a measure that is different than node conservation used to guide alignment constructio作者: Affirm 時(shí)間: 2025-3-29 05:28
The Topological Profile of a Model of Protein Network Evolution Can Direct Model Improvement,enerate networks sharing topological characteristics with their empirical counterparts. It remains a challenge to assess, modify, and improve a model based on the topological values it generates. A large range of parameter values may produce a similar topology, and topological properties may vacilla作者: 槍支 時(shí)間: 2025-3-29 11:13 作者: 善辯 時(shí)間: 2025-3-29 14:44
Orthology Relation and Gene Tree Correction: Complexity Results,her hand, many tree-free methods, mainly based on sequence similarity, are also available. The link between orthology relations and gene trees has been formally considered recently from the angle of reconstructing phylogenies from orthology relations. Here, we rather consider this link from a correc作者: 典型 時(shí)間: 2025-3-29 16:47 作者: Epithelium 時(shí)間: 2025-3-29 22:31
A Sub-quadratic Time and Space Complexity Solution for the Dated Tree Reconciliation Problem for Setotic complexity associated with inferring coevolutionary interrelationships that exist between organismal trees. The leveraging of tree topology for coevolutionary analysis has been shown to be highly successful, with one recent result demonstrating a logarithmic space complexity reduction for the 作者: 苦惱 時(shí)間: 2025-3-30 00:25 作者: 啤酒 時(shí)間: 2025-3-30 06:42
Multiple-Ancestor Localization for Recently Admixed Individuals,netics. The treatment of ancestry as a continuum instead of a categorical trait has been recently advocated in the literature. Particularly, it was shown that a European individual’s geographic coordinates of origin can be determined up?to a few hundred kilometers of error using spatial ancestry inf作者: 詞匯記憶方法 時(shí)間: 2025-3-30 10:45
Association Mapping for Compound Heterozygous Traits Using Phenotypic Distance and Integer Programm to be caused by genetics. The most common explanation for this is the presence of multiple rare mutations that cannot be identified in GWAS due to a lack of statistical power. Such rare mutations may be concentrated in relatively few genes, as is the case for many known Mendelian diseases, where th作者: expire 時(shí)間: 2025-3-30 12:37
Semi-nonparametric Modeling of Topological Domain Formation from Epigenetic Data, of the 3D genome organization and appear to play a role in gene regulation and other functions. Several histone modifications have been independently suggested as the possible explanations of TAD formation, but their combinatorial effects on domain formation remain poorly understood at a global sca作者: 縮影 時(shí)間: 2025-3-30 19:59
Scrible: Ultra-Accurate Error-Correction of Pooled Sequenced Reads,f DNA barcoding when multiplexing a large number of samples on second-generation sequencing instruments. Here we address the problem of correcting the short reads obtained from our sequencing protocol. We introduce a novel algorithm called . that exploits properties of the pooling design to accurate作者: Merited 時(shí)間: 2025-3-30 22:10 作者: MAZE 時(shí)間: 2025-3-31 03:07 作者: Range-Of-Motion 時(shí)間: 2025-3-31 06:30
Circular Sequence Comparison with ,-grams,mparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques. As . genome structure is a common phenomenon in nature, a caveat of specialized alignment techniques for circular sequence comparison is that they are computationally expens作者: BOON 時(shí)間: 2025-3-31 11:43 作者: 邊緣帶來墨水 時(shí)間: 2025-3-31 16:17
A Filtering Approach for Alignment-Free Biosequences Comparison with Mismatches,n fact, in several contexts, with respect to alignment-based approaches, alignment-free techniques are faster but less accurate. Recently, several studies (e.g. [., ., .]) attempted to bridge the accuracy gap with the introduction of approximate matches in the definition of composition-based distanc作者: 珍奇 時(shí)間: 2025-3-31 20:14
Models and Algorithms for Genome Rearrangement with Positional Constraints, same number of rearrangements are considered equally good. In this paper, we acknowledge that each rearrangement has a certain likelihood of occurring based on biological constraints, . physical proximity of the DNA segments implicated, or repetitive sequences. Accordingly, we propose optimization 作者: Affluence 時(shí)間: 2025-4-1 00:07
Sparse RNA Folding Revisited: Space-Efficient Minimum Free Energy Prediction,eractions. Sparsification has been successfully applied to improve the time efficiency of various structure prediction algorithms while guaranteeing the same result; however, for many such folding problems, space efficiency is of even greater concern, in particular for long RNAs and complex folding 作者: outrage 時(shí)間: 2025-4-1 05:17 作者: insidious 時(shí)間: 2025-4-1 09:29 作者: Prologue 時(shí)間: 2025-4-1 13:20
Conference proceedings 2015, in September 2015. The 23 full papers presented were carefully reviewed and selected from 56 submissions. The selected papers cover a wide range of topics from networks to phylogenetic studies, sequence and genome analysis, comparative genomics, and RNA structure.
