Comparative Genomics (Record no. 13762)
[ view plain ]
| 020 ## - | |
|---|---|
| -- | 9783540318149 |
| -- | 978-3-540-31814-9 |
| 024 7# - | |
| -- | 10.1007/11554714 |
| -- | doi |
| 050 #4 - | |
| -- | QA76.9.A43 |
| 072 #7 - | |
| -- | UMB |
| -- | bicssc |
| 072 #7 - | |
| -- | COM051300 |
| -- | bisacsh |
| 082 04 - | |
| -- | 005.1 |
| -- | 23 |
| 100 1# - | |
| -- | McLysaght, Aoife. |
| -- | editor. |
| 245 10 - | |
| -- | Comparative Genomics |
| -- | [electronic resource] : |
| -- | RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005. Proceedings / |
| -- | edited by Aoife McLysaght, Daniel H. Huson. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2005. |
| 300 ## - | |
| -- | VIII, 167 p. Also available online. |
| -- | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - | |
| -- | Lecture Notes in Computer Science, |
| -- | 0302-9743 ; |
| -- | 3678 |
| 505 0# - | |
| -- | 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. |
| 520 ## - | |
| -- | 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. |
| 650 #0 - | |
| -- | Computer science. |
| 650 #0 - | |
| -- | Data structures (Computer science). |
| 650 #0 - | |
| -- | Computer software. |
| 650 #0 - | |
| -- | Computational complexity. |
| 650 #0 - | |
| -- | Database management. |
| 650 #0 - | |
| -- | Bioinformatics. |
| 650 #0 - | |
| -- | Biology |
| -- | Data processing. |
| 650 14 - | |
| -- | Computer Science. |
| 650 24 - | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - | |
| -- | Data Structures. |
| 650 24 - | |
| -- | Discrete Mathematics in Computer Science. |
| 650 24 - | |
| -- | Database Management. |
| 650 24 - | |
| -- | Bioinformatics. |
| 650 24 - | |
| -- | Computer Appl. in Life Sciences. |
| 700 1# - | |
| -- | Huson, Daniel H. |
| -- | editor. |
| 710 2# - | |
| -- | SpringerLink (Online service) |
| 773 0# - | |
| -- | Springer eBooks |
| 776 08 - | |
| -- | Printed edition: |
| -- | 9783540289326 |
| 830 #0 - | |
| -- | Lecture Notes in Computer Science, |
| -- | 0302-9743 ; |
| -- | 3678 |
| 856 40 - | |
| -- | http://dx.doi.org/10.1007/11554714 |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
| 950 ## - | |
| -- | Computer Science (Springer-11645) |
| 999 ## - | |
| -- | 13762 |
| -- | 13762 |
No items available.