Algorithms in Bioinformatics [[electronic resource] ] : 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings / / edited by Philipp Bücher, Bernard M.E. Moret

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
• Edizione: 1st ed. 2006.
• Descrizione fisica: 1 online resource (XII, 402 p.)
• Disciplina: 572.80285
• Soggetto topico: Computer programming; Life sciences; Algorithms; Computers; Data structures (Computer science); Computer science—Mathematics; Programming Techniques; Life Sciences, general; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Data Structures; Discrete Mathematics in Computer Science
• Persona (resp. second.): BücherPhilipp; MoretBernard M.E
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: Measures of Codon Bias in Yeast, the tRNA Pairing Index and Possible DNA Repair Mechanisms -- Decomposing Metabolomic Isotope Patterns -- A Method to Design Standard HMMs with Desired Length Distribution for Biological Sequence Analysis -- Efficient Model-Based Clustering for LC-MS Data -- A Bayesian Algorithm for Reconstructing Two-Component Signaling Networks -- Linear-Time Haplotype Inference on Pedigrees Without Recombinations -- Phylogenetic Network Inferences Through Efficient Haplotyping -- Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems -- On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model -- How Many Transcripts Does It Take to Reconstruct the Splice Graph? -- Multiple Structure Alignment and Consensus Identification for Proteins -- Procrastination Leads to Efficient Filtration for Local Multiple Alignment -- Controlling Size When Aligning Multiple Genomic Sequences with Duplications -- Reducing Distortion in Phylogenetic Networks -- Imputing Supertrees and Supernetworks from Quartets -- A Unifying View of Genome Rearrangements -- Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC -- Alignment with Non-overlapping Inversions in O(n 3)-Time -- Accelerating Motif Discovery: Motif Matching on Parallel Hardware -- Segmenting Motifs in Protein-Protein Interface Surfaces -- Protein Side-Chain Placement Through MAP Estimation and Problem-Size Reduction -- On the Complexity of the Crossing Contact Map Pattern Matching Problem -- A Fuzzy Dynamic Programming Approach to Predict RNA Secondary Structure -- Landscape Analysis for Protein-Folding Simulation in the H-P Model -- Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition -- Flux-Based vs. Topology-Based Similarity of Metabolic Genes -- Combinatorial Methods for Disease Association Search and Susceptibility Prediction -- Integer Linear Programs for Discovering Approximate Gene Clusters -- Approximation Algorithms for Bi-clustering Problems -- Improving the Layout of Oligonucleotide Microarrays: Pivot Partitioning -- Accelerating the Computation of Elementary Modes Using Pattern Trees -- A Linear-Time Algorithm for Studying Genetic Variation -- New Constructive Heuristics for DNA Sequencing by Hybridization -- Optimal Probing Patterns for Sequencing by Hybridization -- Gapped Permutation Patterns for Comparative Genomics -- Segmentation with an Isochore Distribution.
• Titolo autorizzato: Algorithms in Bioinformatics
• ISBN: 3-540-39584-9
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466066203316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Bioinformatics ; ; 4175