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] ] : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings / / edited by Roderic Guigo, Dan Gusfield
| Algorithms in Bioinformatics [[electronic resource] ] : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings / / edited by Roderic Guigo, Dan Gusfield |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 554 p.) |
| Disciplina | 572.80285 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Biochemistry Algorithms Computers Data structures (Computer science) Numerical analysis Programming Techniques Biochemistry, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Numeric Computing |
| ISBN | 3-540-45784-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces -- Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design -- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem -- Methods for Inferring Block-Wise Ancestral History from Haploid Sequences -- Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks -- Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry -- Improved Approximation Algorithms for NMR Spectral Peak Assignment -- Efficient Methods for Inferring Tandem Duplication History -- Genome Rearrangement Phylogeny Using Weighbor -- Segment Match Refinement and Applications -- Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation -- Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics -- FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures -- Efficient Unbound Docking of Rigid Molecules -- A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants -- A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding -- Comparative Methods for Gene Structure Prediction in Homologous Sequences -- MultiProt — A Multiple Protein Structural Alignment Algorithm -- A Hybrid Scoring Function for Protein Multiple Alignment -- Functional Consequences in Metabolic Pathways from Phylogenetic Profiles -- Finding Founder Sequences from a Set of Recombinants -- Estimating the Deviation from a Molecular Clock -- Exploring the Set of All Minimal Sequences of Reversals — An Application to Test the Replication-Directed Reversal Hypothesis -- Approximating the Expected Number of Inversions Given the Number of Breakpoints -- Invited Lecture — Accelerating Smith-Waterman Searches -- Sequence-Length Requirements for Phylogenetic Methods -- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle -- NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks -- On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization -- Restricting SBH Ambiguity via Restriction Enzymes -- Invited Lecture — Molecule as Computation: Towards an Abstraction of Biomolecular Systems -- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search -- Rapid Large-Scale Oligonucleotide Selection for Microarrays -- Border Length Minimization in DNA Array Design* -- The Enhanced Suffix Array and Its Applications to Genome Analysis -- The Algorithmic of Gene Teams -- Combinatorial Use of Short Probes for Differential Gene Expression Profiling -- Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome -- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data -- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data -- Modified Mincut Supertrees. |
| Record Nr. | UNISA-996465404303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms in Bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings / / edited by Roderic Guigo, Dan Gusfield
| Algorithms in Bioinformatics : Second International Workshop, WABI 2002, Rome, Italy, September 17-21, 2002, Proceedings / / edited by Roderic Guigo, Dan Gusfield |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 554 p.) |
| Disciplina | 572.80285 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Biochemistry Algorithms Computers Data structures (Computer science) Numerical analysis Programming Techniques Biochemistry, general Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Numeric Computing |
| ISBN | 3-540-45784-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces -- Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design -- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem -- Methods for Inferring Block-Wise Ancestral History from Haploid Sequences -- Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks -- Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry -- Improved Approximation Algorithms for NMR Spectral Peak Assignment -- Efficient Methods for Inferring Tandem Duplication History -- Genome Rearrangement Phylogeny Using Weighbor -- Segment Match Refinement and Applications -- Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation -- Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics -- FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures -- Efficient Unbound Docking of Rigid Molecules -- A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants -- A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding -- Comparative Methods for Gene Structure Prediction in Homologous Sequences -- MultiProt — A Multiple Protein Structural Alignment Algorithm -- A Hybrid Scoring Function for Protein Multiple Alignment -- Functional Consequences in Metabolic Pathways from Phylogenetic Profiles -- Finding Founder Sequences from a Set of Recombinants -- Estimating the Deviation from a Molecular Clock -- Exploring the Set of All Minimal Sequences of Reversals — An Application to Test the Replication-Directed Reversal Hypothesis -- Approximating the Expected Number of Inversions Given the Number of Breakpoints -- Invited Lecture — Accelerating Smith-Waterman Searches -- Sequence-Length Requirements for Phylogenetic Methods -- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle -- NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks -- On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization -- Restricting SBH Ambiguity via Restriction Enzymes -- Invited Lecture — Molecule as Computation: Towards an Abstraction of Biomolecular Systems -- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search -- Rapid Large-Scale Oligonucleotide Selection for Microarrays -- Border Length Minimization in DNA Array Design* -- The Enhanced Suffix Array and Its Applications to Genome Analysis -- The Algorithmic of Gene Teams -- Combinatorial Use of Short Probes for Differential Gene Expression Profiling -- Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome -- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data -- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data -- Modified Mincut Supertrees. |
| Record Nr. | UNINA-9910143894203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield
| Combinatorial Pattern Matching [[electronic resource] ] : Fifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings / / edited by Maxime Crochemore, Dan Gusfield |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (IX, 331 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Discrete mathematics Algorithms Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Discrete Mathematics Algorithm Analysis and Problem Complexity Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-48450-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees — An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. |
| Record Nr. | UNISA-996466248203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
RECOMB 2004 : proceedings of the eighth annual International Conference on Research in Computational Molecular Biology, March 27-31, 2004, San Diego, California, USA
| RECOMB 2004 : proceedings of the eighth annual International Conference on Research in Computational Molecular Biology, March 27-31, 2004, San Diego, California, USA |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM Press, 2004 |
| Descrizione fisica | 1 online resource (370 p.;) |
| Disciplina | 572.8/01/13 |
| Collana | ACM Conferences |
| Soggetto topico |
Molecular biology - Computer simulation
Biology Health & Biological Sciences Biophysics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | RECOMB '04 |
| Record Nr. | UNINA-9910375843703321 |
| [Place of publication not identified], : ACM Press, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||