000 03887nam a22006375i 4500
001 978-3-540-44696-5
003 DE-He213
005 20240423132433.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540446965
_9978-3-540-44696-5
024 7 _a10.1007/3-540-44696-6
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aAlgorithms in Bioinformatics
_h[electronic resource] :
_bFirst International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings /
_cedited by Olivier Gascuel, Bernard M.E. Moret.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aX, 314 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2149
505 0 _aAn 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.
650 0 _aComputer programming.
650 0 _aLife sciences.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science.
650 1 4 _aProgramming Techniques.
650 2 4 _aLife Sciences.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aTheory of Computation.
700 1 _aGascuel, Olivier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMoret, Bernard M.E.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540425168
776 0 8 _iPrinted edition:
_z9783662200223
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2149
856 4 0 _uhttps://doi.org/10.1007/3-540-44696-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187741
_d187741