| 000 | 02889nam a22005175i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-21233-3 | ||
| 003 | DE-He213 | ||
| 005 | 20200421111200.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 150727s2015 gw | s |||| 0|eng d | ||
| 020 |
_a9783319212333 _9978-3-319-21233-3 |
||
| 024 | 7 |
_a10.1007/978-3-319-21233-3 _2doi |
|
| 050 | 4 | _aQH324.2-324.25 | |
| 072 | 7 |
_aPSA _2bicssc |
|
| 072 | 7 |
_aUB _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 082 | 0 | 4 |
_a570.285 _223 |
| 245 | 1 | 0 |
_aAlgorithms for Computational Biology _h[electronic resource] : _bSecond International Conference, AlCoB 2015, Mexico City, Mexico, August 4-5, 2015, Proceedings / _cedited by Adrian-Horia Dediu, Francisco Hern�andez-Quiroz, Carlos Mart�in-Vide, David A. Rosenblueth. |
| 250 | _a1st ed. 2015. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
|
| 300 |
_aX, 155 p. 49 illus., 2 illus. in color. _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 ; _v9199 |
|
| 505 | 0 | _aGenetic Processing -- Generalized Hultman Numbers and the Distribution of Multi-break Distances -- Implicit Transpositions in Shortest DCJ Scenarios -- Constraint-Based Genetic -- Compilation -- Molecular Recognition/Prediction P2RANK: Knowledge-Based Ligand Binding Site Prediction Using Aggregated Local Features -- StreaM - A Stream-Based Algorithm for Counting Motifs in Dynamic Graphs -- Convolutional LSTM Networks for Subcellular Localization of Proteins -- Phylogenetics -- Hybrid Genetic Algorithm and Lasso Test Approach for Inferring Well Supported Phylogenetic Trees Based on Subsets of Chloroplastic Core Genes -- Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis -- A More Practical Algorithm for the Rooted Triplet Distance -- Likelihood-Based Inference of Phylogenetic Networks from Sequence Data by PhyloDAG -- Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver. . | |
| 520 | _a . | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aBioinformatics. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aComputational Biology/Bioinformatics. |
| 700 | 1 |
_aDediu, Adrian-Horia. _eeditor. |
|
| 700 | 1 |
_aHern�andez-Quiroz, Francisco. _eeditor. |
|
| 700 | 1 |
_aMart�in-Vide, Carlos. _eeditor. |
|
| 700 | 1 |
_aRosenblueth, David A. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319212326 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v9199 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-21233-3 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cEBK | ||
| 999 |
_c53764 _d53764 |
||