Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms in Bioinformatics [[electronic resource] ] : 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings / / edited by Philipp Bücher, Bernard M.E. Moret
| Algorithms in Bioinformatics [[electronic resource] ] : 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings / / edited by Philipp Bücher, Bernard M.E. Moret |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 402 p.) |
| Disciplina | 572.80285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Computer programming
Life sciences Algorithms Computers Data structures (Computer science) Computer science—Mathematics Programming Techniques Life Sciences, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-39584-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Measures of Codon Bias in Yeast, the tRNA Pairing Index and Possible DNA Repair Mechanisms -- Decomposing Metabolomic Isotope Patterns -- A Method to Design Standard HMMs with Desired Length Distribution for Biological Sequence Analysis -- Efficient Model-Based Clustering for LC-MS Data -- A Bayesian Algorithm for Reconstructing Two-Component Signaling Networks -- Linear-Time Haplotype Inference on Pedigrees Without Recombinations -- Phylogenetic Network Inferences Through Efficient Haplotyping -- Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems -- On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model -- How Many Transcripts Does It Take to Reconstruct the Splice Graph? -- Multiple Structure Alignment and Consensus Identification for Proteins -- Procrastination Leads to Efficient Filtration for Local Multiple Alignment -- Controlling Size When Aligning Multiple Genomic Sequences with Duplications -- Reducing Distortion in Phylogenetic Networks -- Imputing Supertrees and Supernetworks from Quartets -- A Unifying View of Genome Rearrangements -- Efficient Sampling of Transpositions and Inverted Transpositions for Bayesian MCMC -- Alignment with Non-overlapping Inversions in O(n 3)-Time -- Accelerating Motif Discovery: Motif Matching on Parallel Hardware -- Segmenting Motifs in Protein-Protein Interface Surfaces -- Protein Side-Chain Placement Through MAP Estimation and Problem-Size Reduction -- On the Complexity of the Crossing Contact Map Pattern Matching Problem -- A Fuzzy Dynamic Programming Approach to Predict RNA Secondary Structure -- Landscape Analysis for Protein-Folding Simulation in the H-P Model -- Rapid ab initio RNA Folding Including Pseudoknots Via Graph Tree Decomposition -- Flux-Based vs. Topology-Based Similarity of Metabolic Genes -- Combinatorial Methods for Disease Association Search and Susceptibility Prediction -- Integer Linear Programs for Discovering Approximate Gene Clusters -- Approximation Algorithms for Bi-clustering Problems -- Improving the Layout of Oligonucleotide Microarrays: Pivot Partitioning -- Accelerating the Computation of Elementary Modes Using Pattern Trees -- A Linear-Time Algorithm for Studying Genetic Variation -- New Constructive Heuristics for DNA Sequencing by Hybridization -- Optimal Probing Patterns for Sequencing by Hybridization -- Gapped Permutation Patterns for Comparative Genomics -- Segmentation with an Isochore Distribution. |
| Record Nr. | UNISA-996466066203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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
| 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
| 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 | ||
| ||