|
|
|
|
| LEADER |
02896nam a22005775i 4500 |
| 001 |
978-3-540-31814-9 |
| 003 |
DE-He213 |
| 005 |
20151204185543.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100315s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540318149
|9 978-3-540-31814-9
|
| 024 |
7 |
|
|a 10.1007/11554714
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QH345
|
| 050 |
|
4 |
|a QD415-436
|
| 072 |
|
7 |
|a PSB
|2 bicssc
|
| 072 |
|
7 |
|a SCI007000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 572
|2 23
|
| 245 |
1 |
0 |
|a Comparative Genomics
|h [electronic resource] :
|b RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005. Proceedings /
|c edited by Aoife McLysaght, Daniel H. Huson.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a VIII, 168 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3678
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Life sciences.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Database management.
|
| 650 |
|
0 |
|a Biochemistry.
|
| 650 |
|
0 |
|a Bioinformatics.
|
| 650 |
1 |
4 |
|a Life Sciences.
|
| 650 |
2 |
4 |
|a Biochemistry, general.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Database Management.
|
| 650 |
2 |
4 |
|a Bioinformatics.
|
| 700 |
1 |
|
|a McLysaght, Aoife.
|e editor.
|
| 700 |
1 |
|
|a Huson, Daniel H.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540289326
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3678
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11554714
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
