000 | 03186nam a22005775i 4500 | ||
---|---|---|---|
001 | 978-3-540-74960-8 | ||
003 | DE-He213 | ||
005 | 20160624102112.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2007 gw | s |||| 0|eng d | ||
020 |
_a9783540749608 _9978-3-540-74960-8 |
||
024 | 7 |
_a10.1007/978-3-540-74960-8 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aComparative Genomics _h[electronic resource] : _bRECOMB 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007. Proceedings / _cedited by Glenn Tesler, Dannie Durand. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2007. |
|
300 |
_aXII, 193 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4751 |
|
505 | 0 | _aMulti-break Rearrangements: From Circular to Linear Genomes -- A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes -- Improving Inversion Median Computation Using Commuting Reversals and Cycle Information -- Inferring a Duplication, Speciation and Loss History from a Gene Tree (Extended Abstract) -- How to Achieve an Equivalent Simple Permutation in Linear Time -- Baculovirus Phylogeny Based on Genome Rearrangements -- Learning Gene Regulatory Networks via Globally Regularized Risk Minimization -- Evolution of Tandemly Arrayed Genes in Multiple Species -- Selecting Genomes for Reconstruction of Ancestral Genomes -- A Heuristic Algorithm for Reconstructing Ancestral Gene Orders with Duplications -- Reconstructing an Inversion History in the Anopheles Gambiae Complex -- Recovering True Rearrangement Events on Phylogenetic Trees -- Parts of the Problem of Polyploids in Rearrangement Phylogeny -- A Rigorous Analysis of the Pattern of Intron Conservation Supports the Coelomata Clade of Animals. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aDatabase management. | |
650 | 0 | _aBioinformatics. | |
650 | 0 |
_aBiology _xData processing. |
|
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aDatabase Management. |
650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
650 | 2 | 4 | _aComputer Appl. in Life Sciences. |
700 | 1 |
_aTesler, Glenn. _eeditor. |
|
700 | 1 |
_aDurand, Dannie. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540749592 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v4751 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-540-74960-8 |
942 |
_2EBK7819 _cEBK |
||
999 |
_c37113 _d37113 |