000			04790nam a22006255i 4500
001			978-3-540-31812-5
003			DE-He213
005			20240423125551.0
007			cr nn 008mamaa
008			100316s2005 gw | s |||| 0|eng d
020			_a9783540318125 _9978-3-540-31812-5
024	7		_a10.1007/11557067 _2doi
050		4	_aQH301-705
072		7	_aPSA _2bicssc
072		7	_aSCI086000 _2bisacsh
072		7	_aPSA _2thema
082	0	4	_a570 _223
245	1	0	_aAlgorithms in Bioinformatics _h[electronic resource] : _b5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings / _cedited by Rita Casadio, Gene Myers.
250			_a1st ed. 2005.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005.
300			_aX, 436 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 Bioinformatics, _x2366-6331 ; _v3692
505	0		_aExpression -- Spectral Clustering Gene Ontology Terms to Group Genes by Function -- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression -- Clustering Gene Expression Series with Prior Knowledge -- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data -- Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds -- Phylogeny -- A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem -- Computing the Quartet Distance Between Trees of Arbitrary Degree -- Using Semi-definite Programming to Enhance Supertree Resolvability -- An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree -- Pattern Identification in Biogeography -- On the Complexity of Several Haplotyping Problems -- A Hidden Markov Technique for Haplotype Reconstruction -- Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event -- Networks -- A Faster Algorithm for Detecting Network Motifs -- Reaction Motifs in Metabolic Networks -- Reconstructing Metabolic Networks Using Interval Analysis -- Genome Rearrangements -- A 1.375-Approximation Algorithm for Sorting by Transpositions -- A New Tight Upper Bound on the Transposition Distance -- Perfect Sorting by Reversals Is Not Always Difficult -- Minimum Recombination Histories by Branch and Bound -- Sequences -- A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds -- Generalized Planted (l,d)-Motif Problem with Negative Set -- Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI) -- The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity -- Multiple Structural RNA Alignmentwith Lagrangian Relaxation -- Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons -- Ortholog Clustering on a Multipartite Graph -- Linear Time Algorithm for Parsing RNA Secondary Structure -- A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance -- Structure -- Optimal Protein Threading by Cost-Splitting -- Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment -- Rotamer-Pair Energy Calculations Using a Trie Data Structure -- Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity -- The Main Structural Regularities of the Sandwich Proteins -- Discovery of Protein Substructures in EM Maps.
650		0	_aLife sciences.
650		0	_aComputer programming.
650		0	_aAlgorithms.
650		0	_aArtificial intelligence _xData processing.
650		0	_aComputer science.
650		0	_aComputer science _xMathematics.
650		0	_aDiscrete mathematics.
650	1	4	_aLife Sciences.
650	2	4	_aProgramming Techniques.
650	2	4	_aAlgorithms.
650	2	4	_aData Science.
650	2	4	_aTheory of Computation.
650	2	4	_aDiscrete Mathematics in Computer Science.
700	1		_aCasadio, Rita. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aMyers, Gene. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783540290087
776	0	8	_iPrinted edition: _z9783540815853
830		0	_aLecture Notes in Bioinformatics, _x2366-6331 ; _v3692
856	4	0	_uhttps://doi.org/10.1007/11557067
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c179381 _d179381