04769nam 22007815 450 991076757440332120200703042653.03-540-44696-610.1007/3-540-44696-6(CKB)1000000000211628(SSID)ssj0000321224(PQKBManifestationID)11241010(PQKBTitleCode)TC0000321224(PQKBWorkID)10263025(PQKB)10003176(DE-He213)978-3-540-44696-5(MiAaPQ)EBC3071869(PPN)155225375(EXLCZ)99100000000021162820121227d2001 u| 0engurnn#008mamaatxtccrAlgorithms in Bioinformatics[electronic resource] First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings /edited by Olivier Gascuel, Bernard M.E. Moret1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (X, 314 p.)Lecture Notes in Computer Science,0302-9743 ;2149Bibliographic Level Mode of Issuance: Monograph3-540-42516-0 Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;2149Computer programmingLife sciencesData structures (Computer science)AlgorithmsComputersProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Life Sciences, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/L00004Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computer programming.Life sciences.Data structures (Computer science).Algorithms.Computers.Programming Techniques.Life Sciences, general.Data Structures and Information Theory.Algorithm Analysis and Problem Complexity.Data Structures.Computation by Abstract Devices.570/.285Gascuel Olivieredthttp://id.loc.gov/vocabulary/relators/edtMoret Bernard M.Eedthttp://id.loc.gov/vocabulary/relators/edtWABI (Workshop)(1st :2001 :Århus, Denmark),MiAaPQMiAaPQMiAaPQBOOK9910767574403321Algorithms in Bioinformatics772095UNINA