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.
Combinatorial Pattern Matching [[electronic resource] ] : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park
| Combinatorial Pattern Matching [[electronic resource] ] : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 452 p.) |
| Disciplina | 511/.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Information storage and retrieval systems Natural language processing (Computer science) Pattern recognition systems Bioinformatics Data Science Information Storage and Retrieval Natural Language Processing (NLP) Automated Pattern Recognition |
| ISBN |
3-540-31562-4
3-540-26201-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. |
| Record Nr. | UNISA-996466120403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park
| Combinatorial Pattern Matching : 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Kunsoo Park |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XII, 452 p.) |
| Disciplina | 511/.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Artificial intelligence—Data processing Information storage and retrieval systems Natural language processing (Computer science) Pattern recognition systems Bioinformatics Data Science Information Storage and Retrieval Natural Language Processing (NLP) Automated Pattern Recognition |
| ISBN |
3-540-31562-4
3-540-26201-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern -- On the Longest Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space -- Succinct Suffix Arrays Based on Run-Length Encoding -- Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets -- Faster Algorithms for ?,?-Matching and Related Problems -- A Fast Algorithm for Approximate String Matching on Gene Sequences -- Approximate Matching in the L 1 Metric -- An Efficient Algorithm for Generating Super Condensed Neighborhoods -- The Median Problem for the Reversal Distance in Circular Bacterial Genomes -- Using PQ Trees for Comparative Genomics -- Hardness of Optimal Spaced Seed Design -- Weighted Directed Word Graph -- Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets -- An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression -- DNA Compression Challenge Revisited: A Dynamic Programming Approach -- On the Complexity of Sparse Exon Assembly -- An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery -- Incremental Inference of Relational Motifs with a Degenerate Alphabet -- Speeding up Parsing of Biological Context-Free Grammars -- A New Periodicity Lemma -- Two Dimensional Parameterized Matching -- An Optimal Algorithm for Online Square Detection -- A Simple Fast Hybrid Pattern-Matching Algorithm -- Prefix-Free Regular-Expression Matching -- Reducing the Size of NFAs by Using Equivalences and Preorders -- Regular Expression Constrained Sequence Alignment -- A Linear Tree Edit Distance Algorithm for Similar Ordered Trees -- A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables -- Assessing the Significance of Sets of Words -- Inferring a Graph from Path Frequency -- Exact and Approximation Algorithms for DNA Tag Set Design -- Parametric Analysis for Ungapped Markov Models of Evolution -- Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements -- Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation -- Mass Spectra Alignments and Their Significance. |
| Record Nr. | UNINA-9910483301103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching [[electronic resource] ] : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNISA-996465400303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda
| Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings / / edited by Alberto Apostolico, Masayuki Takeda |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (VIII, 290 p.) |
| Disciplina | 511.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Pattern recognition Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Discrete Mathematics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-45452-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Practical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. |
| Record Nr. | UNINA-9910143900603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein
| Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Algorithms Information storage and retrieval Computer science—Mathematics Combinatorics Theory of Computation Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Discrete Mathematics in Computer Science |
| ISBN | 3-540-69214-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient decoding with canonical huffman trees -- On weak circular squares in binary words -- An easy case of sorting by reversals -- External inverse pattern matching -- Distributed generation of suffix arrays -- Direct construction of compact directed acyclic word graphs -- Approximation algorithms for the fixed-topology phylogenetic number problem -- A new algorithm for the ordered tree inclusion problem -- On incremental computation of transitive closure and greedy alignment -- Aligning coding DNA in the presence of frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based data structures for sequence assembly -- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices -- Banishing bias from consensus sequences -- On the Nadeau-Taylor theory of conserved chromosome segments -- Iterative versus simultaneous multiple sequence alignment -- Modern comparative lexicostatistics. |
| Record Nr. | UNINA-9910144925103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein
| Combinatorial Pattern Matching [[electronic resource] ] : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings / / edited by Alberto Apostolico, Jotun Hein |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (VIII, 284 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Pattern recognition Algorithms Information storage and retrieval Computer science—Mathematics Combinatorics Theory of Computation Pattern Recognition Algorithm Analysis and Problem Complexity Information Storage and Retrieval Discrete Mathematics in Computer Science |
| ISBN | 3-540-69214-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | An improved pattern matching algorithm for strings in terms of straight-line programs -- Episode matching -- Efficient algorithms for approximate string matching with swaps -- On the complexity of pattern matching for highly compressed two-dimensional texts -- Estimating the probability of approximate matches -- Space- and time-efficient decoding with canonical huffman trees -- On weak circular squares in binary words -- An easy case of sorting by reversals -- External inverse pattern matching -- Distributed generation of suffix arrays -- Direct construction of compact directed acyclic word graphs -- Approximation algorithms for the fixed-topology phylogenetic number problem -- A new algorithm for the ordered tree inclusion problem -- On incremental computation of transitive closure and greedy alignment -- Aligning coding DNA in the presence of frame-shift errors -- A filter method for the weighted local similarity search problem -- Trie-based data structures for sequence assembly -- Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices -- Banishing bias from consensus sequences -- On the Nadeau-Taylor theory of conserved chromosome segments -- Iterative versus simultaneous multiple sequence alignment -- Modern comparative lexicostatistics. |
| Record Nr. | UNISA-996465756903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Combinatorics Pattern Recognition Algorithm Analysis and Problem Complexity Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47732-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A linear time pattern matching algorithm between a string and a tree -- Tight comparison bounds for the string prefix-matching problem -- 3-D docking of protein molecules -- Minimal separators of two words -- Covering a string -- On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings -- An algorithm for locating non-overlapping regions of maximum alignment score -- Exact and approximation algorithms for the inversion distance between two chromosomes -- The maximum weight trace problem in multiple sequence alignment -- An algorithm for approximate tandem repeats -- Two dimensional pattern matching in a digitized image -- Analysis of a string edit problem in a probabilistic framework -- Detecting false matches in string matching algorithms -- On suboptimal alignments of biological sequences -- A fast filtration algorithm for the substring matching problem -- A unifying look at d-dimensional periodicities and space coverings -- Approximate string-matching over suffix trees -- Multiple sequence comparison and n-dimensional image reconstruction -- A new editing based distance between unordered labeled trees. |
| Record Nr. | UNISA-996466082003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
| Combinatorial Pattern Matching [[electronic resource] ] : Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings / / edited by Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (XI, 293 p.) |
| Disciplina | 006.4 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Pattern recognition
Algorithms Discrete mathematics Natural language processing (Computer science) Information storage and retrieval Coding theory Information theory Pattern Recognition Algorithm Analysis and Problem Complexity Discrete Mathematics Natural Language Processing (NLP) Information Storage and Retrieval Coding and Information Theory |
| ISBN | 3-540-47357-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Probabilistic analysis of generalized suffix trees -- A language approach to string searching evaluation -- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm -- Fast multiple keyword searching -- Heaviest increasing/common subsequence problems -- Approximate regular expression pattern matching with concave gap penalties -- Matrix longest common subsequence problem, duality and hilbert bases -- From regular expressions to DFA's using compressed NFA's -- Identifying periodic occurrences of a template with applications to protein structure -- Edit distance for genome comparison based on non-local operations -- 3-D substructure matching in protein Molecules -- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract) -- Grammatical tree matching -- Theoretical and empirical comparisons of approximate string matching algorithms -- Fast and practical approximate string matching -- DZ A text compression algorithm for natural languages -- Multiple alignment with guaranteed error bounds and communication cost -- Two algorithms for the longest common subsequence of three (or more) strings -- Color Set Size problem with applications to string matching -- Computing display conflicts in string and circular string visualization -- Efficient randomized dictionary matching algorithms -- Dynamic dictionary matching with failure functions. |
| Record Nr. | UNISA-996465491703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Research in Computational Molecular Biology [[electronic resource] ] : 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings / / edited by Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel Pevzner, Michael Waterman
| Research in Computational Molecular Biology [[electronic resource] ] : 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings / / edited by Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel Pevzner, Michael Waterman |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVIII, 614 p.) |
| Disciplina | 572.8 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Algorithms
Data structures (Computer science) Computer science—Mathematics Database management Artificial intelligence Bioinformatics Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Database Management Artificial Intelligence |
| ISBN | 3-540-33296-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Integrated Protein Interaction Networks for 11 Microbes -- Hypergraph Model of Multi-residue Interactions in Proteins: Sequentially–Constrained Partitioning Algorithms for Optimization of Site-Directed Protein Recombination -- Biological Networks: Comparison, Conservation, and Evolutionary Trees -- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks -- Clustering Short Gene Expression Profiles -- A Patient-Gene Model for Temporal Expression Profiles in Clinical Studies -- Global Interaction Networks Probed by Mass Spectrometry -- Statistical Evaluation of Genome Rearrangement -- An Improved Statistic for Detecting Over-Represented Gene Ontology Annotations in Gene Sets -- Protein Function Annotation Based on Ortholog Clusters Extracted from Incomplete Genomes Using Combinatorial Optimization -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data -- RNA Secondary Structure Prediction Via Energy Density Minimization -- Structural Alignment of Pseudoknotted RNA -- Stan Ulam and Computational Biology -- CONTRAlign: Discriminative Training for Protein Sequence Alignment -- Clustering Near-Identical Sequences for Fast Homology Search -- New Methods for Detecting Lineage-Specific Selection -- A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer -- A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric -- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations -- Inferring Common Origins from mtDNA -- Efficient Enumeration of Phylogenetically Informative Substrings -- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes -- Maximal Accurate Forests from Distance Matrices -- Leveraging Information Across HLA Alleles/Supertypes Improves Epitope Prediction -- Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence -- An Important Connection Between Network Motifs and Parsimony Models -- Ultraconserved Elements, Living Fossil Transposons, and Rapid Bursts of Change: Reconstructing the Uneven Evolutionary History of the Human Genome -- Permutation Filtering: A Novel Concept for Significance Analysis of Large-Scale Genomic Data -- Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes -- A New Approach to Protein Identification -- Markov Methods for Hierarchical Coarse-Graining of Large Protein Dynamics -- Simulating Protein Motions with Rigidity Analysis -- Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation -- An Outsider’s View of the Genome -- Alignment Statistics for Long-Range Correlated Genomic Sequences -- Simple and Fast Inverse Alignment -- Revealing the Proteome Complexity by Mass Spectrometry -- Motif Yggdrasil: Sampling from a Tree Mixture Model -- A Study of Accessible Motifs and RNA Folding Complexity -- A Parameterized Algorithm for Protein Structure Alignment -- Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction -- A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem -- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles -- 10 Years of the International Conference on Research in Computational Molecular Biology (RECOMB) -- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions -- A Parsimony Approach to Genome-Wide Ortholog Assignment -- Detecting the Dependent Evolution of Biosequences -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data. |
| Record Nr. | UNISA-996466108603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Research in Computational Molecular Biology : 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings / / edited by Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel Pevzner, Michael Waterman
| Research in Computational Molecular Biology : 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings / / edited by Alberto Apostolico, Concettina Guerra, Sorin Istrail, Pavel Pevzner, Michael Waterman |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XVIII, 614 p.) |
| Disciplina | 572.8 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Algorithms
Data structures (Computer science) Computer science—Mathematics Database management Artificial intelligence Bioinformatics Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Database Management Artificial Intelligence |
| ISBN | 3-540-33296-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Integrated Protein Interaction Networks for 11 Microbes -- Hypergraph Model of Multi-residue Interactions in Proteins: Sequentially–Constrained Partitioning Algorithms for Optimization of Site-Directed Protein Recombination -- Biological Networks: Comparison, Conservation, and Evolutionary Trees -- Assessing Significance of Connectivity and Conservation in Protein Interaction Networks -- Clustering Short Gene Expression Profiles -- A Patient-Gene Model for Temporal Expression Profiles in Clinical Studies -- Global Interaction Networks Probed by Mass Spectrometry -- Statistical Evaluation of Genome Rearrangement -- An Improved Statistic for Detecting Over-Represented Gene Ontology Annotations in Gene Sets -- Protein Function Annotation Based on Ortholog Clusters Extracted from Incomplete Genomes Using Combinatorial Optimization -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data -- RNA Secondary Structure Prediction Via Energy Density Minimization -- Structural Alignment of Pseudoknotted RNA -- Stan Ulam and Computational Biology -- CONTRAlign: Discriminative Training for Protein Sequence Alignment -- Clustering Near-Identical Sequences for Fast Homology Search -- New Methods for Detecting Lineage-Specific Selection -- A Probabilistic Model for Gene Content Evolution with Duplication, Loss, and Horizontal Transfer -- A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric -- Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations -- Inferring Common Origins from mtDNA -- Efficient Enumeration of Phylogenetically Informative Substrings -- Phylogenetic Profiling of Insertions and Deletions in Vertebrate Genomes -- Maximal Accurate Forests from Distance Matrices -- Leveraging Information Across HLA Alleles/Supertypes Improves Epitope Prediction -- Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence -- An Important Connection Between Network Motifs and Parsimony Models -- Ultraconserved Elements, Living Fossil Transposons, and Rapid Bursts of Change: Reconstructing the Uneven Evolutionary History of the Human Genome -- Permutation Filtering: A Novel Concept for Significance Analysis of Large-Scale Genomic Data -- Genome-Wide Discovery of Modulators of Transcriptional Interactions in Human B Lymphocytes -- A New Approach to Protein Identification -- Markov Methods for Hierarchical Coarse-Graining of Large Protein Dynamics -- Simulating Protein Motions with Rigidity Analysis -- Predicting Experimental Quantities in Protein Folding Kinetics Using Stochastic Roadmap Simulation -- An Outsider’s View of the Genome -- Alignment Statistics for Long-Range Correlated Genomic Sequences -- Simple and Fast Inverse Alignment -- Revealing the Proteome Complexity by Mass Spectrometry -- Motif Yggdrasil: Sampling from a Tree Mixture Model -- A Study of Accessible Motifs and RNA Folding Complexity -- A Parameterized Algorithm for Protein Structure Alignment -- Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction -- A Branch-and-Reduce Algorithm for the Contact Map Overlap Problem -- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles -- 10 Years of the International Conference on Research in Computational Molecular Biology (RECOMB) -- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions -- A Parsimony Approach to Genome-Wide Ortholog Assignment -- Detecting the Dependent Evolution of Biosequences -- Detecting MicroRNA Targets by Linking Sequence, MicroRNA and Gene Expression Data. |
| Record Nr. | UNINA-9910484571303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||