000			04692nam a22005535i 4500
001			978-3-540-39763-2
003			DE-He213
005			20160624101945.0
007			cr nn 008mamaa
008			121227s2003 gw | s |||| 0|eng d
020			_a9783540397632 _9978-3-540-39763-2
024	7		_a10.1007/b13243 _2doi
050		4	_aQA76.9.A43
072		7	_aUMB _2bicssc
072		7	_aCOM051300 _2bisacsh
082	0	4	_a005.1 _223
245	1	0	_aAlgorithms in Bioinformatics _h[electronic resource] : _bThird International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003. Proceedings / _cedited by Gary Benson, Roderic D. M. Page.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2003.
300			_aX, 534 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, _x0302-9743 ; _v2812
505	0		_aComparative Genomics -- A Local Chaining Algorithm and Its Applications in Comparative Genomics -- Common Intervals of Two Sequences -- A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring -- Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity -- Gene Finding and Expression -- A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods -- A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence -- Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency -- Genome Mapping -- New Algorithm for the Simplified Partial Digest Problem -- Noisy Data Make the Partial Digest Problem NP-hard -- Pattern and Motif Discovery -- Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions -- A Combinatorial Approach to Automatic Discovery of Cluster-Patterns -- Dynamic Programming Algorithms for Two Statistical Problems in Computational Biology -- Phylogenetic Analysis -- Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees -- Efficient Generation of Uniform Samples from Phylogenetic Trees -- New Efficient Algorithm for Detection of Horizontal Gene Transfer Events -- Ancestral Maximum Likelihood of Evolutionary Trees Is Hard -- A Linear-Time Majority Tree Algorithm -- Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model -- Better Hill-Climbing Searches for Parsimony -- Computing Refined Buneman Trees in Cubic Time -- Distance Corrections on Recombinant Sequences -- Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks -- Polymorphism -- Identifying Blocks and Sub-populations in Noisy SNP Data -- Designing Optimally Multiplexed SNP Genotyping Assays -- Minimum Recombinant Haplotype Configuration on Tree Pedigrees -- Protein Structure -- Efficient Energy Computation for Monte Carlo Simulation of Proteins -- Speedup LP Approach to Protein Threading via Graph Reduction -- Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment -- Side-Chain Structure Prediction Based on Dead-End Elimination: Single Split DEE-criterion Implementation and Elimination Power -- Sequence Alignment -- A Large Version of the Small Parsimony Problem -- Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree -- Composition Alignment -- String Algorithms -- Match Chaining Algorithms for cDNA Mapping -- Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt -- Bounds for Resequencing by Hybridization -- Selecting Degenerate Multiplex PCR Primers.
650		0	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aDatabase management.
650		0	_aBioinformatics.
650	1	4	_aComputer Science.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aData Structures.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aMathematics of Computing.
650	2	4	_aDatabase Management.
650	2	4	_aBioinformatics.
700	1		_aBenson, Gary. _eeditor.
700	1		_aPage, Roderic D. M. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540200765
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v2812
856	4	0	_uhttp://dx.doi.org/10.1007/b13243
942			_2EBK4710 _cEBK
999			_c34004 _d34004