Titlebook: Algorithms in Bioinformatics; 7th International Wo Raffaele Giancarlo,Sridhar Hannenhalli Conference proceedings 2007 Springer-Verlag Berli

synovial-joint

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.

创作

商议

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

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

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

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

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.

初次登台

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

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.

词汇记忆方法