標(biāo)題: Titlebook: Algorithms in Bioinformatics; 7th International Wo Raffaele Giancarlo,Sridhar Hannenhalli Conference proceedings 2007 Springer-Verlag Berli [打印本頁] 作者: BID 時間: 2025-3-21 19:10
書目名稱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é)科排名
作者: 滴注 時間: 2025-3-21 23:41 作者: 招惹 時間: 2025-3-22 04:24 作者: epicondylitis 時間: 2025-3-22 07:42
Die “Neue Ordnung” und das “Neue Europa”nerate. Our new approach to this problem uses a weighted graph model and a heuristic that determines high weight subgraphs in polynomial time. Our experimental tests show impressive accuracy and efficiency. We give results that demonstrate a theoretical dichotomy between cliques in our graph that represent actual motifs and those that do not.作者: agenda 時間: 2025-3-22 10:14 作者: callous 時間: 2025-3-22 14:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153268.jpg作者: Accede 時間: 2025-3-22 19:46
,Die pers?nlichen Erfahrungen des Autors,ns a challenging open problem. Although Klaus Biemann recognized the potential of mass spectrometry for sequencing of unknown proteins in the 1980s, low-throughput Edman degradation followed by cloning still remains the main method to sequence unknown proteins. The automated spectral interpretation 作者: Flatus 時間: 2025-3-22 22:41 作者: 使更活躍 時間: 2025-3-23 01:49 作者: 逢迎春日 時間: 2025-3-23 09:21 作者: Cervical-Spine 時間: 2025-3-23 13:25
https://doi.org/10.1007/978-3-663-09590-3mental step towards predicting .-sheet topology. In this work we report a new strand pairing algorithm. Our algorithm attempts to mimic elements of the folding process. Namely, in addition to ensuring that the predicted hydrogen bonded strand pairs satisfy basic global consistency constraints, it ta作者: 切碎 時間: 2025-3-23 17:06 作者: byline 時間: 2025-3-23 21:32
Staatliche und parastaatliche Repressiontive disease association studies. However, while the selected informative tag SNPs may characterize the allele information of a target genomic region, they are not necessarily the ones directly associated with disease or with functional impairment. To address this limitation, we present a first inte作者: jealousy 時間: 2025-3-24 01:48 作者: 瘙癢 時間: 2025-3-24 04:40 作者: Felicitous 時間: 2025-3-24 06:38 作者: Merited 時間: 2025-3-24 11:33
https://doi.org/10.1007/978-3-663-00191-1ations, genome rearrangements, and horizontal transfer of genetic material. Evolutionary analysis of viral sequences is therefore a complicated matter for two main reasons: First, due to HGTs and recombinations, the right model of evolution is a network and not a tree. Second, due to genome rearrang作者: keloid 時間: 2025-3-24 14:49
Die Eigenschaften des Frequenzumformers,em is NP-hard 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. We improve on the time complexity of the local search problem by a factor of .作者: Inferior 時間: 2025-3-24 19:59
Sprachpolitik und Sprachenpolitikully tested in tasks of biosequence analysis and classification. Given a sequence . of . characters drawn from an alphabet ., the problem of extracting such a base from . had been previously solved in time .(|.|.. log.) and .(|.|.. log.), respectively in [9] and [7], through resort to the FFT-based 作者: Tinea-Capitis 時間: 2025-3-24 23:22 作者: Radiculopathy 時間: 2025-3-25 07:01 作者: CRAFT 時間: 2025-3-25 10:33 作者: 外貌 時間: 2025-3-25 13:48 作者: 哪有黃油 時間: 2025-3-25 18:52
https://doi.org/10.1007/978-3-663-09593-4nment methods, although offer accurate comparison, are not fast enough. Therefore, a number of databases storing pre-computed structural similarities are created to handle structural comparison queries efficiently. However, these databases cannot be updated in a timely fashion due to the sheer burde作者: 固定某物 時間: 2025-3-25 21:52 作者: accordance 時間: 2025-3-26 01:32 作者: heckle 時間: 2025-3-26 04:39
https://doi.org/10.1007/978-3-663-09590-3in the population under study. Experimental results on both simulated and real datasets show that proposed methods achieve significantly improved detection accuracy compared to previous methods with highly scalable running time.作者: 結(jié)果 時間: 2025-3-26 10:04
Von der Entfremdung zur Entwürdigung We observed that these informative motifs are mostly spatially localized and present distinctive features of various members of the family. . The source code is available upon request from the authors.作者: 講個故事逗他 時間: 2025-3-26 14:34 作者: 合唱隊 時間: 2025-3-26 19:05
Genotype Error Detection Using Hidden Markov Models of Haplotype Diversity,in the population under study. Experimental results on both simulated and real datasets show that proposed methods achieve significantly improved detection accuracy compared to previous methods with highly scalable running time.作者: synovial-joint 時間: 2025-3-27 00:01
Informative Motifs in Protein Family Alignments, We observed that these informative motifs are mostly spatially localized and present distinctive features of various members of the family. . The source code is available upon request from the authors.作者: 創(chuàng)作 時間: 2025-3-27 05:09 作者: 商議 時間: 2025-3-27 09:21
Die einzelnen Kern-Arbeitsfelder von AFRO,gnificantly better than the spectrum and the mismatch kernels. When used together with RLS, performance of the locality kernels is comparable with some state-of-the-art methods of protein classification and remote homology detection.作者: SPALL 時間: 2025-3-27 09:32
Die einzelnen Kern-Arbeitsfelder von AFRO,presentation of proteins using global features provides effective information for protein family classification, with comparable results to those obtained by representation using local sequence alignment scores. Furthermore, a combination of global and local sequence features significantly improves classification performance.作者: Albumin 時間: 2025-3-27 13:46
Locality Kernels for Protein Classification,gnificantly better than the spectrum and the mismatch kernels. When used together with RLS, performance of the locality kernels is comparable with some state-of-the-art methods of protein classification and remote homology detection.作者: EWER 時間: 2025-3-27 21:28
When Less Is More: Improving Classification of Protein Families with a Minimal Set of Global Featurpresentation of proteins using global features provides effective information for protein family classification, with comparable results to those obtained by representation using local sequence alignment scores. Furthermore, a combination of global and local sequence features significantly improves classification performance.作者: nurture 時間: 2025-3-27 23:36
Bringing Folding Pathways into Strand Pairing Prediction,kes into account hypothetical folding pathways. Consistently with this view, introducing hydrogen bonds between a pair of strands changes the probabilities of forming other strand pairs. We demonstrate that this approach provides an improvement over previously proposed algorithms.作者: 初次登臺 時間: 2025-3-28 04:14
Seeded Tree Alignment and Planar Tanglegram Layout,e matching based on seeded nodes has applications in pattern matching of RNA structures, unordered tree matching based on seeded nodes has applications in co-speciation and phylogeny reconciliation. The latter involves the solution of the planar tanglegram layout problem, for which we give a polynomial-time algorithm.作者: ARCH 時間: 2025-3-28 08:59
An ,(,,/log,) Speed-Up of , Heuristics for the Gene-Duplication Problem, ./log., where . is the size of the resulting species supertree. Typically, several thousand instances of the local search problem are solved throughout a stepwise heuristic search. Hence, our improvement makes the gene-duplication problem much more tractable for large-scale phylogenetic analyses.作者: 詞匯記憶方法 時間: 2025-3-28 13:27 作者: 盡責(zé) 時間: 2025-3-28 17:42
https://doi.org/10.1007/978-3-663-09590-3kes into account hypothetical folding pathways. Consistently with this view, introducing hydrogen bonds between a pair of strands changes the probabilities of forming other strand pairs. We demonstrate that this approach provides an improvement over previously proposed algorithms.作者: Venules 時間: 2025-3-28 22:41
https://doi.org/10.1007/978-3-663-00191-1e matching based on seeded nodes has applications in pattern matching of RNA structures, unordered tree matching based on seeded nodes has applications in co-speciation and phylogeny reconciliation. The latter involves the solution of the planar tanglegram layout problem, for which we give a polynomial-time algorithm.作者: definition 時間: 2025-3-29 00:00 作者: CODE 時間: 2025-3-29 07:07 作者: 不感興趣 時間: 2025-3-29 10:58
Sprachpolitik und Sprachenpolitikg such a base from . had been previously solved in time .(|.|.. log.) and .(|.|.. log.), respectively in [9] and [7], through resort to the FFT-based string searching by Fischer and Paterson [5]. More recently, a solution taking time .(|.|..) without resort to the FFT was also devised [4].作者: OASIS 時間: 2025-3-29 11:34
Andreas Stoffers,Long Quang Ph?m,ve proposed a new approach based on a class of . that is largely used in optimization of real world applications. The obtained results are interesting in terms of the quality of the structures (RMSD–. .) and energy values found.作者: Trigger-Point 時間: 2025-3-29 15:42 作者: mitral-valve 時間: 2025-3-29 22:11
Generalized Pattern Search and Mesh Adaptive Direct Search Algorithms for Protein Structure Predictve proposed a new approach based on a class of . that is largely used in optimization of real world applications. The obtained results are interesting in terms of the quality of the structures (RMSD–. .) and energy values found.作者: GORGE 時間: 2025-3-30 01:41 作者: 愛管閑事 時間: 2025-3-30 04:22 作者: Corral 時間: 2025-3-30 11:34
Two Birds, One Stone: Selecting Functionally Informative Tag SNPs for Disease Association Studies,l significance of SNPs. To evaluate our system, we compare it to other state-of-the-art SNP selection systems, which conduct both information-based tag SNP selection and function-based SNP selection, but do so in two separate consecutive steps. Using 14 datasets, based on disease-related genes curat作者: ALE 時間: 2025-3-30 12:27 作者: 摸索 時間: 2025-3-30 19:03 作者: 斜 時間: 2025-3-30 20:50 作者: 寵愛 時間: 2025-3-31 01:32
Alignment-Free Local Structural Search by Writhe Decomposition,two structures by measuring distance between their projected points. These methods offer a tremendous increase in speed over residue-level structural alignment methods. However, current projection methods are not practical, partly because they are unable to identify local similarities. We propose a 作者: CEDE 時間: 2025-3-31 06:50 作者: 誘騙 時間: 2025-3-31 11:03 作者: Firefly 時間: 2025-3-31 16:45
,Die pers?nlichen Erfahrungen des Autors,estern diamondback rattlesnake venom. We further argue that Shotgun Protein Sequencing has the potential to overcome the limitations of current protein sequencing approaches and thus catalyze the otherwise impractical applications of proteomics methodologies in studies of unknown proteins. We furthe作者: Expostulate 時間: 2025-3-31 19:33
https://doi.org/10.1007/978-3-663-09590-3ete contact maps. FT-COMAR can ignore up to 75% of the contact map and still recover from the remaining 25% entries a 3D structure whose root mean square deviation (RMSD) from the native one is less then 4 ?. Our results indicate that the quality more than the quantity of predicted contacts is relev作者: Evacuate 時間: 2025-3-31 22:23 作者: muffler 時間: 2025-4-1 03:15
Der aphasische Symptomenkomplex,d. A heuristic locally-optimal algorithm is given for founder construction. Combined with flat parsing this already gives quite good haplotyping results. Improved haplotyping is obtained by using a hierarchical parsing that properly models the natural recombination process. For finding short hierarc作者: cortisol 時間: 2025-4-1 08:23
https://doi.org/10.1007/978-3-663-00191-1lyzing such complex models of evolution, investigate their computational complexity, and devise algorithms for solving them. Moreover, we demonstrate the viability of our methods on several synthetic datasets as well as biological datasets.作者: 獨輪車 時間: 2025-4-1 14:08 作者: agonist 時間: 2025-4-1 16:28
https://doi.org/10.1007/978-3-663-09593-4two structures by measuring distance between their projected points. These methods offer a tremendous increase in speed over residue-level structural alignment methods. However, current projection methods are not practical, partly because they are unable to identify local similarities. We propose a 作者: subordinate 時間: 2025-4-1 18:52 作者: inclusive 時間: 2025-4-2 00:46 作者: 顧客 時間: 2025-4-2 03:31
Locality Kernels for Protein Classification,ur locality kernels measure protein sequence similarities within a small window constructed around matching amino acids. The kernels incorporate positional information of the amino acids inside the window and allow a range of position dependent similarity evaluations. We use these kernels with regul
