標(biāo)題: Titlebook: Bioinformatics Research and Applications; Fourth International Ion M?ndoiu,Raj Sunderraman,Alexander Zelikovsky Conference proceedings 2008 [打印本頁(yè)] 作者: choleric 時(shí)間: 2025-3-21 19:20
書(shū)目名稱Bioinformatics Research and Applications影響因子(影響力)
書(shū)目名稱Bioinformatics Research and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱Bioinformatics Research and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Bioinformatics Research and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Bioinformatics Research and Applications被引頻次
書(shū)目名稱Bioinformatics Research and Applications被引頻次學(xué)科排名
書(shū)目名稱Bioinformatics Research and Applications年度引用
書(shū)目名稱Bioinformatics Research and Applications年度引用學(xué)科排名
書(shū)目名稱Bioinformatics Research and Applications讀者反饋
書(shū)目名稱Bioinformatics Research and Applications讀者反饋學(xué)科排名
作者: extinguish 時(shí)間: 2025-3-21 22:17 作者: vasculitis 時(shí)間: 2025-3-22 01:37
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches,ion events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the . ., which i作者: 深淵 時(shí)間: 2025-3-22 08:04
A Distance-Based Method for Detecting Horizontal Gene Transfer in Whole Genomes,me evolution. Methods for detecting horizontal gene transfer from sequence abound. Among the most accurate are methods based on phylogenetic tree inference, but even these can perform poorly in some cases, such as when multiple trees fit the data equally well. In addition, they tend to be computatio作者: 避開(kāi) 時(shí)間: 2025-3-22 09:01
An Approach for Determining Evolutionary Distance in Network-Based Phylogenetic Analysis,etabolic networks. The differences between networks, often expressed as evolutionary distances, are normally measured using the plain .. In this paper, we show enzymes are different in phylogenetic conservation and topological importance, which are correlated significantly. Inspired by this observat作者: BUST 時(shí)間: 2025-3-22 12:58
Pairwise Statistical Significance Versus Database Statistical Significance for Local Alignment of Pt programs report the statistical significance of an alignment in context of a database search. This database statistical significance is dependent on the database, and hence, the same alignment of a pair of sequences may be assessed different statistical significance values in different databases. 作者: ELATE 時(shí)間: 2025-3-22 18:43
Estimating Pairwise Statistical Significance of Protein Local Alignments Using a Clustering-Classifwn to follow an extreme value distribution with analytically calculable parameters . and . for ungapped alignments with one substitution matrix. But no statistical theory is currently available for the gapped case and for alignments using multiple scoring matrices, although their score distribution 作者: 單調(diào)性 時(shí)間: 2025-3-23 00:57
Gapped Extension for Local Multiple Alignment of Interspersed DNA Repeats,equence alignment methods have been the prevailing technique to identify homologous nucleotides. However, existing methods that identify and align all homologous nucleotides in one or more genomes have suffered poor scalability and limited accuracy. We propose a novel method that couples a gapped ex作者: nerve-sparing 時(shí)間: 2025-3-23 01:53 作者: Observe 時(shí)間: 2025-3-23 07:23 作者: Odyssey 時(shí)間: 2025-3-23 13:40
PFP: A Computational Framework for Phylogenetic Footprinting in Prokaryotic Genomes,ed motifs in the upstream sequences of orthologous genes in eukaryotic genomes. However, this popular strategy may not be directly applicable to prokaryotic genomes, where typically about half of the genes in a genome form multiple-gene transcription units or operons. The promoter sequences for thes作者: Pigeon 時(shí)間: 2025-3-23 17:26
Accelerating the Neighbor-Joining Algorithm Using the Adaptive Bucket Data Structure,ly at each iteration. Accelerating the neighbor-joining method requires performing a smarter search for an optimal pair of neighbors, avoiding re-evaluation of all possible pairs of points at each iteration..We developed an acceleration technique for the neighbor-joining method that significantly de作者: 在前面 時(shí)間: 2025-3-23 19:57 作者: Abnormal 時(shí)間: 2025-3-23 23:02
Physicochemical Correlation between Amino Acid Sites in Short Sequences under Selective Pressure,stitutions which tend to destabilize a particular structure may be compensated by other substitutions which confer stability to that structure. Patterns of coordinated substitutions were studied in two sets of selected peptides. The first is a set of 181 amino acid sequences that were selected . to 作者: critique 時(shí)間: 2025-3-24 06:15 作者: 不確定 時(shí)間: 2025-3-24 07:03
A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring,he output. Candidate peptides can be determined by finding forbidden-pairs paths in a spectrum graph constructed from the mass spectrometer data, assigning scores to vertices and/or edges in order to favor higher-scoring peptides. Chen et al.?gave an algorithm to find the highest-scoring forbidden-p作者: 漂泊 時(shí)間: 2025-3-24 12:59 作者: patriot 時(shí)間: 2025-3-24 16:06
Incorporating Literature Knowledge in Bayesian Network for Inferring Gene Networks with Gene Expresed for this problem. The incorporation of various genomic and proteomic data has been shown to enhance the learning ability in the Bayesian Network (BN) approach. However, the knowledge embedded in the large body of published literature has not been utilized in a systematic way. In this work, prior 作者: 空氣 時(shí)間: 2025-3-24 21:56 作者: 裁決 時(shí)間: 2025-3-24 23:18
0302-9743 , held in Atlanta, GA, USA in May 2008. The 35 revised full papers presented together with 6 workshop papers and 6 invited papers were carefully reviewed and selected from a total of 94 submissions. The papers cover a wide range of topics, including clustering and classification, gene expression ana作者: 不滿分子 時(shí)間: 2025-3-25 03:43
https://doi.org/10.1007/978-3-658-06516-4ed one marker at a time using simple tests such as the Cochran-Armitage trend test. Though computationally simple, a significant limitation of such an analysis paradigm is its failure to efficiently use the information contained in the GWAS sample.作者: 過(guò)渡時(shí)期 時(shí)間: 2025-3-25 10:31 作者: 吸引力 時(shí)間: 2025-3-25 13:56
https://doi.org/10.1007/978-3-663-10466-7 are asymptotically just as efficient as our algorithm for the . search problem. The substantially extended . search problem, along with the exceptional speed-up achieved, make the gene-duplication problem more tractable for large-scale phylogenetic analyses.作者: TEN 時(shí)間: 2025-3-25 19:30
Keine Hochschule für den Sozialismuserforms well precisely in cases where phylogenetic approaches struggle. We conclude that a distance-based approach may be a valuable addition to the set of tools currently available for identifying horizontal gene transfer.作者: 責(zé)怪 時(shí)間: 2025-3-25 22:23
https://doi.org/10.1007/978-3-322-92511-4we reduced the computational costs by up to 20 % depending on the database size and subset used. We also implemented approximate search which further reduced computational costs for the the sake of some accuracy loss.作者: Magnificent 時(shí)間: 2025-3-26 01:21
https://doi.org/10.1007/978-3-322-92511-4rch experiments. We then discuss p-function properties, its applications for finding highly reliable matches in MS experiments, and a possibility to analytically evaluate properties of SEQUEST X-correlation function.作者: ascetic 時(shí)間: 2025-3-26 05:00
Workaholismus: Wenn Arbeit zur Sucht wird, can vary depending on the incident edges used that runs in .(....) time on a graph with . forbidden pairs and a maximum vertex degree of ., and prove its correctness. We are currently working on a Java implementation of this algorithm that we plan on incorporating into the Illinois Bio-Grid Desktop.作者: 凈禮 時(shí)間: 2025-3-26 09:40
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches, are asymptotically just as efficient as our algorithm for the . search problem. The substantially extended . search problem, along with the exceptional speed-up achieved, make the gene-duplication problem more tractable for large-scale phylogenetic analyses.作者: clarify 時(shí)間: 2025-3-26 13:40
A Distance-Based Method for Detecting Horizontal Gene Transfer in Whole Genomes,erforms well precisely in cases where phylogenetic approaches struggle. We conclude that a distance-based approach may be a valuable addition to the set of tools currently available for identifying horizontal gene transfer.作者: Compatriot 時(shí)間: 2025-3-26 18:15 作者: 保全 時(shí)間: 2025-3-26 23:46
Computing P-Values for Peptide Identifications in Mass Spectrometry,rch experiments. We then discuss p-function properties, its applications for finding highly reliable matches in MS experiments, and a possibility to analytically evaluate properties of SEQUEST X-correlation function.作者: DAMP 時(shí)間: 2025-3-27 03:33
A Dynamic Programming Algorithm for De Novo Peptide Sequencing with Variable Scoring, can vary depending on the incident edges used that runs in .(....) time on a graph with . forbidden pairs and a maximum vertex degree of ., and prove its correctness. We are currently working on a Java implementation of this algorithm that we plan on incorporating into the Illinois Bio-Grid Desktop.作者: hypotension 時(shí)間: 2025-3-27 06:45
Conference proceedings 2008lected from a total of 94 submissions. The papers cover a wide range of topics, including clustering and classification, gene expression analysis, gene networks, genome analysis, motif finding, pathways, protein structure prediction, protein domain interactions, phylogenetics, and software tools.作者: Communal 時(shí)間: 2025-3-27 09:48 作者: 跑過(guò) 時(shí)間: 2025-3-27 17:17 作者: 編輯才信任 時(shí)間: 2025-3-27 21:04 作者: 恃強(qiáng)凌弱的人 時(shí)間: 2025-3-28 01:28 作者: Oration 時(shí)間: 2025-3-28 04:03 作者: Precursor 時(shí)間: 2025-3-28 08:16
An Approach for Determining Evolutionary Distance in Network-Based Phylogenetic Analysis,isms, but also the phylogenetic or topological difference of individual enzymes. The resulting evolutionary distance measures are compared with the plain . by use of 16s rRNA-based distance as reference. It shows that new distance measures make errors smaller in all test cases of comparison.作者: 吞吞吐吐 時(shí)間: 2025-3-28 11:42 作者: 不能仁慈 時(shí)間: 2025-3-28 15:56 作者: BUMP 時(shí)間: 2025-3-28 21:23 作者: Dappled 時(shí)間: 2025-3-28 22:54
Hierarchical Clustering Using Constraints,f constraints the corresponding part of the supertree is identified and its set of constraints is displayed such as the user may decide to modify or keep it. Our algorithm is not affected by the order in which the input phylogenies or other constraints are presented. We apply our method to a number of data sets.作者: 食品室 時(shí)間: 2025-3-29 03:17
Generalized Gene Adjacencies, Graph Bandwidth and Clusters in Yeast Evolution, and to what extent they are preserved from ancestor to descendant in a phylogenetic tree. We infer the latter property by dynamic programming optimization of the presence of individual edges at the ancestral nodes of the phylogeny. We apply our analysis to a set of genomes drawn from the Yeast Gene Order Browser.作者: encomiast 時(shí)間: 2025-3-29 10:25
0302-9743 lysis, gene networks, genome analysis, motif finding, pathways, protein structure prediction, protein domain interactions, phylogenetics, and software tools.978-3-540-79449-3978-3-540-79450-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 構(gòu)成 時(shí)間: 2025-3-29 15:23 作者: 新星 時(shí)間: 2025-3-29 15:48 作者: 笨重 時(shí)間: 2025-3-29 20:49
Estimating Pairwise Statistical Significance of Protein Local Alignments Using a Clustering-Classififferent cluster pairs has large variability even for the same scoring scheme, underscoring the heavy dependence of . and . on the amino acid composition. The proposed approach in this paper is an attempt to separate the influence of amino acid composition in estimation of statistical significance o作者: PAEAN 時(shí)間: 2025-3-29 23:57
Gapped Extension for Local Multiple Alignment of Interspersed DNA Repeats,on frequencies for nucleotide substitutions can be derived from any strand/species-symmetric nucleotide substitution matrix, and we have developed a method to adapt an arbitrary substitution matrix (i.e. HOXD) to organisms with different G+C content. We evaluate the performance of our method and pre作者: Ascendancy 時(shí)間: 2025-3-30 04:15 作者: Terrace 時(shí)間: 2025-3-30 10:41 作者: legacy 時(shí)間: 2025-3-30 13:46 作者: AND 時(shí)間: 2025-3-30 18:57 作者: choroid 時(shí)間: 2025-3-30 20:51 作者: 頂點(diǎn) 時(shí)間: 2025-3-31 04:57
Installation der Schutzprogrammetical significance. We evaluated this method in an experiment with a subset of CATH2.3, which had been previoulsy used by other authors as a benchmark data set for protein comparison. Comparison of results with database statistical significance reported by popular programs like SSEARCH and PSI-BLAST作者: 骨 時(shí)間: 2025-3-31 05:32 作者: Bumptious 時(shí)間: 2025-3-31 10:24 作者: 招募 時(shí)間: 2025-3-31 16:59 作者: 弄污 時(shí)間: 2025-3-31 19:39
,Richtiger Stress ist nützlich,y, when the algorithm determines that the elements of the bucket need to be re-evaluated based on new values of . .. As a result, only a small portion of candidate pairs of nodes is examined at each iteration..The algorithm is cache efficient, since the bucket data structures are able to exploit loc作者: faucet 時(shí)間: 2025-3-31 22:51
,Richtiger Stress ist nützlich,. The results indicate that the proposed algorithms can identify edges in learned networks with higher biological relevance. Furthermore, the method using literature knowledge for the reduction of the search space outperformed the method using a structure prior in the BN framework.作者: MUMP 時(shí)間: 2025-4-1 02:09
Mobbing: Die Kollegen machen mich fertig,he goodness of the estimated TFAs and their connectivity strengths. The approach can also be used to evaluate the confidence level of different data sources, considering the inevitable inconsistency among the data sources. The iNCA approach has been applied to a time course microarray data set of mu作者: 運(yùn)動(dòng)的我 時(shí)間: 2025-4-1 09:27
https://doi.org/10.1007/978-3-540-79450-9bioinformatics; biological systems analysis; cellular systems; classification; complexity; computational 作者: 抵制 時(shí)間: 2025-4-1 10:24
978-3-540-79449-3Springer-Verlag Berlin Heidelberg 2008作者: cruise 時(shí)間: 2025-4-1 14:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/187173.jpg作者: 繁榮地區(qū) 時(shí)間: 2025-4-1 19:43 作者: 蔑視 時(shí)間: 2025-4-2 00:04
https://doi.org/10.1007/978-3-476-03567-7nome-wide association studies in which the entire human genome is mined for genes involved in etiology of complex traits. This approach for discovery of genetic risk factors has yielded promising results, but most of the analyses have focused on single marker tests. In general, a method of analysis 作者: Blood-Vessels 時(shí)間: 2025-4-2 06:26
,über nationale Grenzen hinweg,nts that expresses either the hierarchical relationships in a family of given phylogenies, or/and other relations between clusters of sets of species. The output of the algorithm is a multifurcating rooted supertree which satisfies all constraints. Moreover, if there were contradictions in the set o作者: 不可救藥 時(shí)間: 2025-4-2 08:34
https://doi.org/10.1007/978-3-663-10466-7ion events. This problem is NP-complete and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the . ., which i作者: 油膏 時(shí)間: 2025-4-2 13:43
Keine Hochschule für den Sozialismusme evolution. Methods for detecting horizontal gene transfer from sequence abound. Among the most accurate are methods based on phylogenetic tree inference, but even these can perform poorly in some cases, such as when multiple trees fit the data equally well. In addition, they tend to be computatio
