Book Volume 3692 2005

Algorithms in Bioinformatics

5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005. Proceedings


ISBN: 978-3-540-29008-7 (Print) 978-3-540-31812-5 (Online)

Table of contents (35 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Expression

    1. Hybrid Methods

      1. Chapter

        Pages 1-12

        Spectral Clustering Gene Ontology Terms to Group Genes by Function

      2. Chapter

        Pages 13-26

        Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression

      Time Patterns

      1. Chapter

        Pages 27-38

        Clustering Gene Expression Series with Prior Knowledge

      2. Chapter

        Pages 39-52

        A Linear Time Biclustering Algorithm for Time Series Gene Expression Data

      3. Chapter

        Pages 53-64

        Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds

  3. Phylogeny

    1. Quartets

      1. Chapter

        Pages 65-76

        A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem

      2. Chapter

        Pages 77-88

        Computing the Quartet Distance Between Trees of Arbitrary Degree

      Tree Reconciliation

      1. Chapter

        Pages 89-103

        Using Semi-definite Programming to Enhance Supertree Resolvability

      2. Chapter

        Pages 104-115

        An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree

      Clades and Haplotypes

      1. Chapter

        Pages 116-127

        Pattern Identification in Biogeography

      2. Chapter

        Pages 128-139

        On the Complexity of Several Haplotyping Problems

      3. Chapter

        Pages 140-151

        A Hidden Markov Technique for Haplotype Reconstruction

      4. Chapter

        Pages 152-164

        Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event

  4. Networks

    1. Chapter

      Pages 165-177

      A Faster Algorithm for Detecting Network Motifs

    2. Chapter

      Pages 178-191

      Reaction Motifs in Metabolic Networks

    3. Chapter

      Pages 192-203

      Reconstructing Metabolic Networks Using Interval Analysis

  5. Genome Rearrangements

    1. Trasposition Model

      1. Chapter

        Pages 204-215

        A 1.375-Approximation Algorithm for Sorting by Transpositions

      2. Chapter

        Pages 216-227

        A New Tight Upper Bound on the Transposition Distance

      Other Models

      1. Chapter

        Pages 228-238

        Perfect Sorting by Reversals Is Not Always Difficult

      2. Chapter

        Pages 239-250

        Minimum Recombination Histories by Branch and Bound

previous Page of 2