Amazon cover image
Image from Amazon.com

Algorithms in Bioinformatics [electronic resource] : First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 2149Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001Edition: 1st ed. 2001Description: X, 314 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540446965
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.11 23
LOC classification:
  • QA76.6-76.66
Online resources:
Contents:
An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs.
In: Springer Nature eBook
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in