Algorithms in Bioinformatics [electronic resource] : 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005. Proceedings / edited by Rita Casadio, Gene Myers.

Contributor(s): Casadio, Rita [editor.] | Myers, Gene [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 3692Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Description: X, 436 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540318125Subject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Bioinformatics | Computer Science | Algorithm Analysis and Problem Complexity | Data Structures | Computation by Abstract Devices | Discrete Mathematics in Computer Science | Probability and Statistics in Computer Science | BioinformaticsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
Contents:
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 Alignment with 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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK3614

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 Alignment with 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha