LEADER 03962nam  22007575  450 
001 996465622003316
005 20200701063043.0
010   $a3-540-31814-3
024 7 $a10.1007/11554714
035   $a(CKB)1000000000213249
035   $a(SSID)ssj0000316720
035   $a(PQKBManifestationID)11223763
035   $a(PQKBTitleCode)TC0000316720
035   $a(PQKBWorkID)10275021
035   $a(PQKB)11326929
035   $a(DE-He213)978-3-540-31814-9
035   $a(MiAaPQ)EBC3067533
035   $a(PPN)123097460
035   $a(EXLCZ)991000000000213249
100   $a20100315d2005      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aComparative Genomics$b[electronic resource] $eRECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings /$fedited by Aoife McLysaght, Daniel H. Huson
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (VIII, 168 p.) 
225 1 $aLecture Notes in Bioinformatics ;$v3678
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-28932-1 
320   $aIncludes bibliographical references and index.
327   $aLower Bounds for Maximum Parsimony with Gene Order Data -- Genes Order and Phylogenetic Reconstruction: Application to ?-Proteobacteria -- Maximizing Synteny Blocks to Identify Ancestral Homologs -- An Expectation-Maximization Algorithm for Analysis of Evolution of Exon-Intron Structure of Eukaryotic Genes -- Likely Scenarios of Intron Evolution -- OMA, A Comprehensive, Automated Project for the Identification of Orthologs from Complete Genome Data: Introduction and First Achievements -- The Incompatible Desiderata of Gene Cluster Properties -- The String Barcoding Problem is NP-Hard -- A Partial Solution to the C-Value Paradox -- Individual Gene Cluster Statistics in Noisy Maps -- Power Boosts for Cluster Tests -- Reversals of Fortune -- Very Low Power to Detect Asymmetric Divergence of Duplicated Genes -- A Framework for Orthology Assignment from Gene Rearrangement Data.
410  0$aLecture Notes in Bioinformatics ;$v3678
606   $aBiochemistry
606   $aAlgorithms
606   $aData structures (Computer science)
606   $aComputer science?Mathematics
606   $aDatabase management
606   $aBioinformatics
606   $aBiochemistry, general$3https://scigraph.springernature.com/ontologies/product-market-codes/L14005
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
606   $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aDatabase Management$3https://scigraph.springernature.com/ontologies/product-market-codes/I18024
606   $aBioinformatics$3https://scigraph.springernature.com/ontologies/product-market-codes/L15001
615  0$aBiochemistry.
615  0$aAlgorithms.
615  0$aData structures (Computer science).
615  0$aComputer science?Mathematics.
615  0$aDatabase management.
615  0$aBioinformatics.
615 14$aBiochemistry, general.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aData Structures.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aDatabase Management.
615 24$aBioinformatics.
676   $a572.8/6
702   $aMcLysaght$b Aoife$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aHuson$b Daniel H$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996465622003316
996   $aComparative Genomics$9771945
997   $aUNISA