Algorithms in Bioinformatics: 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004. Proceedings
Author: Inge Jonassen, Junhyong Kim
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-23018-2
DOI: 10.1007/b100405

Table of Contents:

Reversing Gene Erosion – Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Sorting by Reversals with Common Intervals
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals
Algorithms for Finding Maximal-Scoring Segment Sets
Gapped Local Similarity Search with Provable Guarantees
Monotone Scoring of Patterns with Mismatches
Suboptimal Local Alignments Across Multiple Scoring Schemes
A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic
Adding Hidden Nodes to Gene Networks
Joint Analysis of DNA Copy Numbers and Gene Expression Levels
Searching for Regulatory Elements of Alternative Splicing Events Using Phylogenetic Footprinting
Supervised Learning-Aided Optimization of Expert-Driven Functional Protein Sequence Annotation
Multiple Vector Seeds for Protein Alignment
Solving the Protein Threading Problem by Lagrangian Relaxation
Protein-Protein Interfaces: Recognition of Similar Spatial and Chemical Organizations
ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences
Local Search Heuristic for Rigid Protein Docking
Sequence Database Compression for Peptide Identification from Tandem Mass Spectra

Includes bibliographical references and index
Reversing gene erosion -- reconstructing ancestral bacterial genomes from gene-content and order data -- Reconstructing ancestral gene orders using conserved intervals -- Sorting by reversals with common intervals -- A polynomial-time algorithm for the matching of crossing contact-map patterns -- A 1.5-approximation algorithm for sorting by transpositions and transreversals -- Algorithms for finding maximal-scoring segment sets -- Gapped local similarity search with provable guarantees -- Monotone scoring of patterns with mismatches -- Suboptimal local alignments across multiple scoring schemes -- A faster reliable algorithm to estimate the p-value of the multinomial 11r statistic -- Adding hidden nodes to gene networks -- Joint analysis of DNA copy numbers and gene expression levels -- Searching for regulatory elements of alternative splicing events using phylogenetic footprinting -- Supervised learning-aided optimization of expert-driven functional protein sequence annotation -- Multiple vector seeds for protein alignment
Solving the protein threading problem by lagrangian relaxation -- Protein-protein interfaces: recognition of similar spatial and chemical organizations -- ATDD: an algorithmic tool for domain discovery in protein sequences -- Local search heuristic for rigid protein docking -- Sequence database compression for peptide identification from tandem mass spectra -- Linear reduction for haplotype inference -- A new integer programming formulation for the pure parsimony problem in haplotype analysis -- Fast hare: a fast heuristic -- Approximation algorithms for the selection of robust tag SNPs -- The minisatellite transformation problem revisited: a run length encoded approach -- A faster and more space-efficient algorithm for inferring arc- annotations of RNA sequences through alignment -- New algorithms for multiple DNA sequence alignment -- Chaining algorithms for alignment of draft sequence -- Translation initiation sites prediction with mixture Gaussian models -- Online consensus and agreement of phylogenetic trees -- Relation of residues in the variable region of 16S rDNA sequences and their relevance to genus-specificity
Topological rearrangements and local search method for tandem duplication trees -- Phylogenetic super-networks from partial trees -- Genome identification and classification by short oligo arrays -- Novel tree edit operations for RNA secondary structure comparison -- The most probable labeling problem in HMMs and its application to bioinformatics -- Integrating sample-driven and pattern-driven approaches in motif finding -- Finding optimal pairs of patterns -- Finding missing patterns