Algorithms in Bioinformatics [[electronic resource] ] : First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Olivier Gascuel, Bernard M.E. Moret |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (X, 314 p.) |
Disciplina | 570/.285 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Life sciences Data structures (Computer science) Algorithms Computers Programming Techniques Life Sciences, general Data Structures and Information Theory Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices |
ISBN | 3-540-44696-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs. |
Record Nr. | UNISA-996465914403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms in Bioinformatics : First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings / / edited by Olivier Gascuel, Bernard M.E. Moret |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (X, 314 p.) |
Disciplina | 570/.285 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Life sciences Data structures (Computer science) Algorithms Computers Programming Techniques Life Sciences, general Data Structures and Information Theory Algorithm Analysis and Problem Complexity Data Structures Computation by Abstract Devices |
ISBN | 3-540-44696-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | An Improved Model for Statistical Alignment -- Improving Profile-Profile Alignments via Log Average Scoring -- False Positives in Genomic Map Assembly and Sequence Validation -- Boosting EM for Radiation Hybrid and Genetic Mapping -- Placing Probes along the Genome Using Pairwise Distance Data -- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar -- Assessing the Statistical Significance of Overrepresented Oligonucleotides -- Pattern Matching and Pattern Discovery Algorithms for Protein Topologies -- Computing Linking Numbers of a Filtration -- Side Chain-Positioning as an Integer Programming Problem -- A Chemical-Distance-Based Test for Positive Darwinian Selection -- Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time -- Experiments in Computing Sequences of Reversals -- Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes -- Finding an Optimal Inversion Median: Experimental Results -- Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites -- The Performance of Phylogenetic Methods on Trees of Bounded Diameter -- (1+?)-Approximation of Sorting by Reversals and Transpositions -- On the Practical Solution of the Reversal Median Problem -- Algorithms for Finding Gene Clusters -- Determination of Binding Amino Acids Based on Random Peptide Array Screening Data -- A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites -- Comparing Assemblies Using Fragments and Mate-Pairs. |
Record Nr. | UNINA-9910767574403321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Computational Biology [[electronic resource] ] : First International Conference on Biology, Informatics, and Mathematics, JOBIM 2000 Montpellier, France, May 3-5, 2000 Selected Papers / / edited by Olivier Gascuel, Marie-France Sagot |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (X, 170 p.) |
Disciplina | 570/.285 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Life sciences Algorithms Data structures (Computer science) Coding theory Information theory Computer science—Mathematics Theory of Computation Life Sciences, general Algorithm Analysis and Problem Complexity Data Structures Coding and Information Theory Mathematics of Computing |
ISBN | 3-540-45727-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Speeding Up the DIALIGN Multiple Alignment Program by Using the ‘Greedy Alignment of BIOlogical Sequences LIBrary’ (GABIOS-LIB) -- GeMCore, a Knowledge Base Dedicated to Mapping Mammalian Genomes -- Optimal Agreement Supertrees -- Segmentation by Maximal Predictive Partitioning According to Composition Biases -- Can We Have Confidence in a Tree Representation? -- Bayesian Approach to DNA Segmentation into Regions with Different Average Nucleotide Composition -- Exact and Asymptotic Distribution of the Local Score of One i.i.d. Random Sequence -- Phylogenetic Reconstruction Algorithms Based on Weighted 4-Trees -- Computational Complexity of Word Counting -- Eugène: An Eukaryotic Gene Finder That Combines Several Sources of Evidence -- Tree Reconstruction via a Closure Operation on Partial Splits -- InterDB, a Prediction-Oriented Protein Interaction Database for C. elegans -- Application of Regulatory Sequence Analysis and Metabolic Network Analysis to the Interpretation of Gene Expression Data. |
Record Nr. | UNISA-996465887303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Computational Biology : First International Conference on Biology, Informatics, and Mathematics, JOBIM 2000 Montpellier, France, May 3-5, 2000 Selected Papers / / edited by Olivier Gascuel, Marie-France Sagot |
Edizione | [1st ed. 2001.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
Descrizione fisica | 1 online resource (X, 170 p.) |
Disciplina | 570/.285 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Life sciences Algorithms Data structures (Computer science) Coding theory Information theory Computer science—Mathematics Theory of Computation Life Sciences, general Algorithm Analysis and Problem Complexity Data Structures Coding and Information Theory Mathematics of Computing |
ISBN | 3-540-45727-5 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Speeding Up the DIALIGN Multiple Alignment Program by Using the ‘Greedy Alignment of BIOlogical Sequences LIBrary’ (GABIOS-LIB) -- GeMCore, a Knowledge Base Dedicated to Mapping Mammalian Genomes -- Optimal Agreement Supertrees -- Segmentation by Maximal Predictive Partitioning According to Composition Biases -- Can We Have Confidence in a Tree Representation? -- Bayesian Approach to DNA Segmentation into Regions with Different Average Nucleotide Composition -- Exact and Asymptotic Distribution of the Local Score of One i.i.d. Random Sequence -- Phylogenetic Reconstruction Algorithms Based on Weighted 4-Trees -- Computational Complexity of Word Counting -- Eugène: An Eukaryotic Gene Finder That Combines Several Sources of Evidence -- Tree Reconstruction via a Closure Operation on Partial Splits -- InterDB, a Prediction-Oriented Protein Interaction Database for C. elegans -- Application of Regulatory Sequence Analysis and Metabolic Network Analysis to the Interpretation of Gene Expression Data. |
Record Nr. | UNINA-9910143601203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|