Comparative Genomics RECOMB 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Tesler, Glenn (Επιμελητής έκδοσης), Durand, Dannie (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4751
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03119nam a22005775i 4500
001 978-3-540-74960-8
003 DE-He213
005 20151204145958.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540749608  |9 978-3-540-74960-8 
024 7 |a 10.1007/978-3-540-74960-8  |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 2007 International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007. Proceedings /  |c edited by Glenn Tesler, Dannie Durand. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a XII, 193 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 4751 
505 0 |a Multi-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 |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 Bioinformatics. 
650 0 |a Biochemistry. 
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 Discrete Mathematics in Computer Science. 
650 2 4 |a Data Structures. 
650 2 4 |a Database Management. 
650 2 4 |a Computational Biology/Bioinformatics. 
700 1 |a Tesler, Glenn.  |e editor. 
700 1 |a Durand, Dannie.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540749592 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4751 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-74960-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)