標(biāo)題: Titlebook: Bioinformatics Research and Applications; 8th International Sy Leonidas Bleris,Ion M?ndoiu,Jianxin Wang Conference proceedings 2012 Springe [打印本頁] 作者: gloomy 時(shí)間: 2025-3-21 18:25
書目名稱Bioinformatics Research and Applications影響因子(影響力)
書目名稱Bioinformatics Research and Applications影響因子(影響力)學(xué)科排名
書目名稱Bioinformatics Research and Applications網(wǎng)絡(luò)公開度
書目名稱Bioinformatics Research and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Bioinformatics Research and Applications被引頻次
書目名稱Bioinformatics Research and Applications被引頻次學(xué)科排名
書目名稱Bioinformatics Research and Applications年度引用
書目名稱Bioinformatics Research and Applications年度引用學(xué)科排名
書目名稱Bioinformatics Research and Applications讀者反饋
書目名稱Bioinformatics Research and Applications讀者反饋學(xué)科排名
作者: Orthodontics 時(shí)間: 2025-3-21 20:22 作者: 欺騙世家 時(shí)間: 2025-3-22 03:55
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem,generalize the work of Halldórsson .’ by showing how one can incorporate prior knowledge about the location of deletion; we prove the general .-hardness of the problem and we provide a state-of-the-art mixed integer programming formulation and a number of possible strengthening valid inequalities ab作者: VOC 時(shí)間: 2025-3-22 06:51
Reconstruction of Transcription Regulatory Networks by Stability-Based Network Component Analysis,(NCA) has become a powerful scheme to uncover the networks behind complex biological processes, especially when gene expression data is integrated with binding motif information. However, the performance of NCA is impaired by the high rate of false connections in binding motif information and the hi作者: Tremor 時(shí)間: 2025-3-22 08:58 作者: Gudgeon 時(shí)間: 2025-3-22 16:47
A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees,nship between bipartitions and quartets, our approach significantly improves upon the performance of existing quartet distance algorithms. To explore QuickQuartet’s performance, sets of biological data containing 20,000 and 33,306 trees over 150 taxa and 567 taxa, respectively are analyzed. Experime作者: SIT 時(shí)間: 2025-3-22 17:29
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices,atrix with very sparse rows. We give a worst-case error bound in terms of an auxiliary LP, as well as graph-theoretic characterizations of the optimum of this error bound in the case of two variables per row. The LP solution indicates which measurements should be combined to minimize the additive er作者: 偏離 時(shí)間: 2025-3-22 21:22 作者: 召集 時(shí)間: 2025-3-23 02:02
Identifying Rogue Taxa through Reduced Consensus: NP-Hardness and Exact Algorithms,reduce the resolution of the consensus tree (e.g., the majority-rule or strict consensus) for a collection. The reduced consensus approach aims to identify and eliminate rogue taxa to produce more informative consensus trees. Given a collection of phylogenetic trees over the same leaf set, the goal 作者: 無目標(biāo) 時(shí)間: 2025-3-23 08:01
Analytics Approaches for the Era of 10,000* Genomes *and Counting, democratizes genome sequencing, it is also democratizing data analysis, with predictably uneven results. Can analytics approaches save us from everything from poorly documented analysis protocols to increasingly compressed and confusing visualizations?作者: MAZE 時(shí)間: 2025-3-23 10:24
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches,e duplication, gene duplication and loss, and deep coalescence. These problems are NP-complete, and consequently, they often are addressed by effective local search heuristics that perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local s作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-23 14:38 作者: lipoatrophy 時(shí)間: 2025-3-23 21:10 作者: Endemic 時(shí)間: 2025-3-24 00:13 作者: fleeting 時(shí)間: 2025-3-24 04:56 作者: hemoglobin 時(shí)間: 2025-3-24 06:58 作者: 者變 時(shí)間: 2025-3-24 10:58
POPE: Pipeline of Parentally-Biased Expression,case. Deviations from additive expectation are observable even at the level of gene expression, and identifying such instances is a prerequisite to the understanding of gene regulation and networks. Many biological studies employ mRNA-seq to identify instances where the overall and allelic expressio作者: staging 時(shí)間: 2025-3-24 17:51 作者: Endometrium 時(shí)間: 2025-3-24 21:12 作者: THROB 時(shí)間: 2025-3-25 02:53
Madina Junussova,Aigul Beimishevastudy and the credible rooting of trees. Finally, we present detailed empirical studies based on real data sets demonstrating the performance of our novel RF measure, the efficiency of our linear time algorithm and the quality of determining optimal rootings of unrooted gene trees.作者: Commonplace 時(shí)間: 2025-3-25 05:37 作者: Radiculopathy 時(shí)間: 2025-3-25 08:24
https://doi.org/10.1007/978-3-030-37389-4c, whereas results on the functional study reveal that conserved transcripts are more likely to share protein domains than functional sites. These studies validate our framework for the study of evolution in large collections of organisms from the perspective of transcripts; we developed and provide a new tool, TrEvoR, for this purpose.作者: Blatant 時(shí)間: 2025-3-25 15:38
Natalia Ribberink,Lisa Schubertonsensus of the original trees is bounded. We describe exact integer linear programming formulations for computing reduced strict, majority and loose consensus trees. In experimental tests, our exact solutions improved over heuristic methods on several problem instances.作者: conceal 時(shí)間: 2025-3-25 16:27 作者: 檔案 時(shí)間: 2025-3-25 23:16
Kazakhstan’s Developmental Journeypublished . (SLR) method, in the context of SAM to re-estimate the expected statistics and FDR. iPLR can be applied to one-sided or two-sided statistics based tests. We demonstrate the efficacy of iPLR on both simulated and real microarray datasets. iPLR also provides a better interpretation of the linear model parameters.作者: Popcorn 時(shí)間: 2025-3-26 03:45 作者: Hallmark 時(shí)間: 2025-3-26 07:31 作者: 祖?zhèn)髫?cái)產(chǎn) 時(shí)間: 2025-3-26 09:27 作者: Admonish 時(shí)間: 2025-3-26 13:24 作者: Compassionate 時(shí)間: 2025-3-26 19:33 作者: Salivary-Gland 時(shí)間: 2025-3-26 23:41 作者: 耐寒 時(shí)間: 2025-3-27 03:14 作者: 依法逮捕 時(shí)間: 2025-3-27 07:43
On Optimizing the Non-metric Similarity Search in Tandem Mass Spectra by Clustering,g speeds up the identification of sequences more than 100× with respect to the sequential scan of the entire database. Moreover, when the protein candidates are refined by sequential scan in the postprocessing step, the whole approach exhibits precision similar to that of sequential scan over the entire database (over 90%).作者: GNAT 時(shí)間: 2025-3-27 09:52 作者: dyspareunia 時(shí)間: 2025-3-27 16:39 作者: BET 時(shí)間: 2025-3-27 18:22
Investments in the Digital Silk Roadntal results show that QuickQuartet is up to 100 times faster than existing methods. With the availability of QuickQuartet, the use of quartet distance as a tool for analysis of evolutionary relationships becomes a practical tool for biologists to use in order to gain new insights regarding their large tree collections.作者: Ventilator 時(shí)間: 2025-3-27 22:58 作者: jovial 時(shí)間: 2025-3-28 05:43 作者: 令人作嘔 時(shí)間: 2025-3-28 07:51 作者: synovitis 時(shí)間: 2025-3-28 12:55 作者: 止痛藥 時(shí)間: 2025-3-28 16:46 作者: 懶鬼才會(huì)衰弱 時(shí)間: 2025-3-28 22:35
A Mixed Integer Programming Model for the Parsimonious Loss of Heterozygosity Problem,ss of the problem and we provide a state-of-the-art mixed integer programming formulation and a number of possible strengthening valid inequalities able to exactly solve practical instances of the PLHOP containing up to 9.000 individuals and 3000 SNPs within 12 hours compute time.作者: pacifist 時(shí)間: 2025-3-29 00:28 作者: Functional 時(shí)間: 2025-3-29 04:12
A Fast Algorithm for Computing the Quartet Distance for Large Sets of Evolutionary Trees,ntal results show that QuickQuartet is up to 100 times faster than existing methods. With the availability of QuickQuartet, the use of quartet distance as a tool for analysis of evolutionary relationships becomes a practical tool for biologists to use in order to gain new insights regarding their large tree collections.作者: nettle 時(shí)間: 2025-3-29 11:07
Error Propagation in Sparse Linear Systems with Peptide-Protein Incidence Matrices,ror of any chosen variable. The results are applied to the problem of inferring the amounts of proteins in a mixture, given inaccurate measurements of the amounts of peptides after enzymatic digestion. Results on simulated data (but from real proteins split by trypsin) suggest that the errors of most variables blow up by very small factors only.作者: 大漩渦 時(shí)間: 2025-3-29 14:13 作者: sclera 時(shí)間: 2025-3-29 18:51
Ben Tsutomu Saji,Tohru Kobayashiew measure, the . (normIC), is proposed which is able to distinguish motifs in real promoter sequences. Preliminary experiments are conducted on Tompa’s benchmark to investigate the performance of our proposed algorithm,. (TrieAMD). Results show that our algorithm outperforms all of the tested tools作者: fluoroscopy 時(shí)間: 2025-3-29 20:44 作者: 牽連 時(shí)間: 2025-3-30 01:57
Beibit Sabirov,Gulzada Shakulikova sometimes theory follows application, sometimes theory precedes application, and sometimes they walk hand-in-hand. Recent and not so recent developments on analysis of models of computational processes in biology, in the context of gene and protein networks that arise in organism development and ce作者: Cumulus 時(shí)間: 2025-3-30 04:18 作者: GEON 時(shí)間: 2025-3-30 12:03
Kazakhstan’s Developmental Journeynstream analysis..In this paper we present the first discussion of multiple typed individuals in non-isomorphic pedigrees, . and ., where the likelihoods are non-identifiable, ., for all input data . and all recombination rate parameters .. While there were previously known non-identifiable pairs, w作者: ARIA 時(shí)間: 2025-3-30 13:31
https://doi.org/10.1007/978-3-319-93833-2ters. On the other hand, the model has a precise, formal specification that insures its coherence, consistency and scalability. We give several examples, among them a comparison of 24 Smox gene transcripts across five species.作者: Obituary 時(shí)間: 2025-3-30 18:38 作者: 種子 時(shí)間: 2025-3-30 22:38 作者: accessory 時(shí)間: 2025-3-31 04:11 作者: craving 時(shí)間: 2025-3-31 05:16
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches,t NNI based local search heuristics for unrooted GTP problems, which enable analyses for thousands of genes. Further, analysis of a large plant data set using the unrooted NNI search provides support for an intriguing new hypothesis regarding the evolutionary relationships among major groups of flow作者: CRASS 時(shí)間: 2025-3-31 10:02 作者: JEER 時(shí)間: 2025-3-31 17:05 作者: inhibit 時(shí)間: 2025-3-31 19:28
https://doi.org/10.1007/978-3-642-30191-9comparative genomics; evolutionary biology; protein sequences identification; systems biology; visualiza作者: AWRY 時(shí)間: 2025-3-31 22:24 作者: 搖曳的微光 時(shí)間: 2025-4-1 05:42 作者: lattice 時(shí)間: 2025-4-1 06:35 作者: 破布 時(shí)間: 2025-4-1 10:12
Bioinformatics Research and Applications978-3-642-30191-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: sterilization 時(shí)間: 2025-4-1 15:23 作者: 宏偉 時(shí)間: 2025-4-1 21:40
Ben Tsutomu Saji,Tohru Kobayashig recurring patterns in these sequences. Apriori is a well-known data mining algorithm. It is used to mine frequent patterns in large datasets. In this paper, we would like to apply Apriori to the common motifs discovery problem. We propose three modifications so that we can adapt the classic Aprior
