01191nkm 2200361 450 991070493240332120150316130326.0(CKB)5470000002446423(OCoLC)904962974(EXLCZ)99547000000244642320150316d2008 ua iengurcn|||||||||stirdacontentcrdamediacrrdacarrierEvery act counts the ocean is not a dance floor[Washington, DC] :[U.S. Department of Commerce, National Oceanic and Atmospheric Administration],[2008]1 online resource (1 poster) color illustrationsTitle from title screen (viewed on Mar. 13, 2015)."IYOR 2008 International Year of the Reef."Every act counts Coral reef ecologyPostersDeep divingPostersCoral reef ecologyDeep divingUnited States.National Oceanic and Atmospheric Administration,GPOGPOBOOK9910704932403321Every act counts3443871UNINA05515nam 22008415 450 991048383640332120251226202439.03-540-31814-310.1007/11554714(CKB)1000000000213249(SSID)ssj0000316720(PQKBManifestationID)11223763(PQKBTitleCode)TC0000316720(PQKBWorkID)10275021(PQKB)11326929(DE-He213)978-3-540-31814-9(MiAaPQ)EBC3067533(PPN)123097460(BIP)12712051(EXLCZ)99100000000021324920100315d2005 u| 0engurnn|008mamaatxtccrComparative Genomics RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings /edited by Aoife McLysaght, Daniel H. Huson1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (VIII, 168 p.) Lecture Notes in Bioinformatics,2366-6331 ;3678Bibliographic Level Mode of Issuance: Monograph3-540-28932-1 Includes bibliographical references and index.Lower 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.The 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.Lecture Notes in Bioinformatics,2366-6331 ;3678BiochemistryAlgorithmsArtificial intelligenceData processingComputer scienceMathematicsDiscrete mathematicsDatabase managementBioinformaticsBiochemistryAlgorithmsData ScienceDiscrete Mathematics in Computer ScienceDatabase ManagementBioinformaticsBiochemistry.Algorithms.Artificial intelligenceData processing.Computer scienceMathematics.Discrete mathematics.Database management.Bioinformatics.Biochemistry.Algorithms.Data Science.Discrete Mathematics in Computer Science.Database Management.Bioinformatics.572.8/6McLysaght Aoife1754883Huson Daniel H1754884MiAaPQMiAaPQMiAaPQBOOK9910483836403321Comparative genomics4191395UNINA