Algorithms in Bioinformatics - neues Buch

EAN (ISBN-13): 9783540318125
Erscheinungsjahr: 2005
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2017-04-19T00:53:35+02:00 (Berlin)
Buch zuletzt gefunden am 2026-01-15T11:02:17+01:00 (Berlin)
ISBN/EAN: 9783540318125

ISBN - alternative Schreibweisen:
978-3-540-31812-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: mallorca, algorithms bioinformatics

---

Daten vom Verlag:

Autor/in: Rita Casadio; Gene Myers
Titel: Lecture Notes in Bioinformatics; Lecture Notes in Computer Science; Algorithms in Bioinformatics - 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings
Verlag: Springer; Springer Berlin
436 Seiten
Erscheinungsjahr: 2005-10-21
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
X, 436 p.

EA; E107; eBook; Nonbooks, PBS / Biologie; Biowissenschaften, allgemein; Verstehen; Alignment; algorithm; algorithmics; algorithms; approximation algorithms; bioinformatics; clustering; computational biology; data analysis; data mining; discrete mathematics; genetic mapping; genome; genome analysis; pattern searching; algorithm analysis and problem complexity; data structures; C; Life Sciences; Programming Techniques; Algorithms; Data Science; Theory of Computation; Discrete Mathematics in Computer Science; Computer Science; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Datenbanken; Theoretische Informatik; Mathematik für Informatiker; Diskrete Mathematik; BC

Expression.- Spectral Clustering Gene Ontology Terms to Group Genes by Function.- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression.- Clustering Gene Expression Series with Prior Knowledge.- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data.- Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds.- Phylogeny.- A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem.- Computing the Quartet Distance Between Trees of Arbitrary Degree.- Using Semi-definite Programming to Enhance Supertree Resolvability.- An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree.- Pattern Identification in Biogeography.- On the Complexity of Several Haplotyping Problems.- A Hidden Markov Technique for Haplotype Reconstruction.- Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event.- Networks.- A Faster Algorithm for Detecting Network Motifs.- Reaction Motifs in Metabolic Networks.- Reconstructing Metabolic Networks Using Interval Analysis.- Genome Rearrangements.- A 1.375-Approximation Algorithm for Sorting by Transpositions.- A New Tight Upper Bound on the Transposition Distance.- Perfect Sorting by Reversals Is Not Always Difficult.- Minimum Recombination Histories by Branch and Bound.- Sequences.- A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds.- Generalized Planted (l,d)-Motif Problem with Negative Set.- Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI).- The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity.- Multiple Structural RNA Alignmentwith Lagrangian Relaxation.- Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons.- Ortholog Clustering on a Multipartite Graph.- Linear Time Algorithm for Parsing RNA Secondary Structure.- A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance.- Structure.- Optimal Protein Threading by Cost-Splitting.- Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment.- Rotamer-Pair Energy Calculations Using a Trie Data Structure.- Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity.- The Main Structural Regularities of the Sandwich Proteins.- Discovery of Protein Substructures in EM Maps.