LEADER 00748nam0-2200277 --450 001 9910583700203321 005 20220727084707.0 010 $a978-88-581-4626-2 100 $a20220727d2021----kmuy0itay5050 ba 101 0 $aita$cita 102 $aIT 105 $ay 001yy 200 1 $aFermare l'odio$fLuciano Canfora 210 $aBari$aRoma$cGLF editori Laterza$d2021 215 $aIX, 65 p.$d20 cm 225 1 $aEconomica Laterza$v975 610 0 $aViolenza 676 $a303.6$v23$zita 700 1$aCanfora,$bLuciano$038986 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910583700203321 952 $aCOLLEZ. 1623 (975)$b1313/2022$fFSPBC 959 $aFSPBC 996 $aFermare l'odio$91732744 997 $aUNINA LEADER 05515nam 22008415 450 001 9910483836403321 005 20251226202439.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(BIP)12712051 035 $a(EXLCZ)991000000000213249 100 $a20100315d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComparative Genomics $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,$x2366-6331 ;$v3678 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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. 330 $aThe complexity of genome evolution poses many exciting challenges to devel- ers of mathematical models and algorithms, who have recourse to a spectrum of algorithmic,statisticalandmathematicaltechniques,rangingfromexact,heur- tic, ?xed-parameter and approximation algorithms for problems based on par- mony models to Monte Carlo Markov Chain algorithms for Bayesian analysis of problems based on probabilistic models. The annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB ComparativeGenomics)is aforumonallaspects andcomponents of this ?eld,rangingfromnew quantitativediscoveriesabout genomestructureand process to theorems on the complexity of computational problems inspired by genome comparison. The informal steering committee for this meeting consists of David Sanko?, Jens Lagergren and Aoife McLysaght. Thisvolumecontainsthepaperspresentedatthe3rdRECOMBComparative Genomicsmeeting,whichwasheldinDublin,Ireland,onSeptember18-20,2005. The ?rst two meetings of this series were held in Minneapolis, USA (2003) and Bertinoro, Italy (2004). This year, 21 papers were submitted, of which the Program Committee - lected 14 for presentation at the meeting and inclusion in this proceedings.Each submission was refereed by at least three members of the Program Committee. Aftercompletionofthereferees'reports,anextensiveWeb-baseddiscussiontook placeformakingdecisions.TheRECOMBComparativeGenomics2005Program Committee consisted of the following 27 members: Vineet Bafna, Anne Be- eron, Mathieu Blanchette, Avril Coghlan, Dannie Durand, Nadia El-Mabrouk, Niklas Eriksen, Aaron Halpern, Rose Hoberman, Daniel Huson, Jens Lagergren, Giuseppe Lancia, Emmanuelle Lerat, Aoife McLysaght, Istvan Miklos, Bernard Moret, PavelPevzner, Ben Raphael, Marie-FranceSagot, David Sanko?, Cathal Seoighe, Beth Shapiro, Igor Sharakhov, Mike Steel, Jens Stoye, Glenn Tesler and Louxin Zhan. We would like to thank the ProgramCommittee members for their dedication and hard work. 410 0$aLecture Notes in Bioinformatics,$x2366-6331 ;$v3678 606 $aBiochemistry 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aDatabase management 606 $aBioinformatics 606 $aBiochemistry 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aDatabase Management 606 $aBioinformatics 615 0$aBiochemistry. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aDatabase management. 615 0$aBioinformatics. 615 14$aBiochemistry. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aDatabase Management. 615 24$aBioinformatics. 676 $a572.8/6 701 $aMcLysaght$b Aoife$01754883 701 $aHuson$b Daniel H$01754884 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483836403321 996 $aComparative genomics$94191395 997 $aUNINA