Algorithms in Bioinformatics
Springer Berlin (Verlag)
978-3-540-87360-0 (ISBN)
- Lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Multichromosomal Genome Median and Halving Problems.- A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem.- Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem.- Read Mapping Algorithms for Single Molecule Sequencing Data.- Exact Transcriptome Reconstruction from Short Sequence Reads.- Post-Hybridization Quality Measures for Oligos in Genome-Wide Microarray Experiments.- NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.- Minimum Common String Partition Parameterized.- Hardness and Approximability of the Inverse Scope Problem.- Rapid Neighbour-Joining.- Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices.- Efficient Genome Wide Tagging by Reduction to SAT.- Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming.- An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem.- A Faster Algorithm for RNA Co-folding.- An Automated Combination of Kernels for Predicting Protein Subcellular Localization.- Fast Target Set Reduction for Large-Scale Protein Function Prediction: A Multi-class Multi-label Machine Learning Approach.- Multiple Instance Learning Allows MHC Class II Epitope Predictions Across Alleles.- An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks.- Enumerating Precursor Sets of Target Metabolites in a Metabolic Network.- Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach.- Fast Bayesian Haplotype Inference Via Context Tree Weighting.- Genotype Sequence Segmentation: Handling Constraints and Noise.- Constructing Phylogenetic Supernetworks from Quartets.- Summarizing Multiple Gene TreesUsing Cluster Networks.- Fast and Adaptive Variable Order Markov Chain Construction.- Computing Alignment Seed Sensitivity with Probabilistic Arithmetic Automata.- The Relation between Indel Length and Functional Divergence: A Formal Study.- Detecting Repeat Families in Incompletely Sequenced Genomes.- Novel Phylogenetic Network Inference by Combining Maximum Likelihood and Hidden Markov Models.- A Local Move Set for Protein Folding in Triangular Lattice Models.- Protein Decoy Generation Using Branch and Bound with Efficient Bounding.
| Erscheint lt. Verlag | 10.9.2008 |
|---|---|
| Reihe/Serie | Lecture Notes in Bioinformatics | Lecture Notes in Computer Science |
| Zusatzinfo | XIII, 396 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Schlagworte | Algorithm analysis and problem complexity • Algorithmics • algorithms • approximation algorithms • Bioinformatics • Clustering • combinatorial optimization • Completeness • Computational Biology • Data Analysis • Data Mining • data structures • Discrete Mathematics • fingerprinting data • functional genomics • gene networks • Genetic Mapping • Genome Analysis • genomic indexing • Graph Computations • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • machine learning • metabolic networks • Molecular Biology • Partition • Pathways • pattern searching • Performance Analysis • Phylogenetic diversity • Phylogenetic trees • Protein Analysis • protein classification • Proteomics • Searching Algorithms • Segmentation • Sequence Analysis • String Matching • structure prediction |
| ISBN-10 | 3-540-87360-0 / 3540873600 |
| ISBN-13 | 978-3-540-87360-0 / 9783540873600 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
