Combinatorial Pattern Matching [[electronic resource] ] : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings / / edited by Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXII, 283 p. 38 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Pattern recognition systems
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Bioinformatics Automated Pattern Recognition Numerical Analysis Discrete Mathematics in Computer Science Data Science Computational and Systems Biology |
ISBN | 3-319-07566-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Trees -- Regular expressions -- Graphs -- Point sets -- Arrays. |
Record Nr. | UNISA-996199997803316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorial Pattern Matching : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings / / edited by Alexander S. Kulikov, Sergei O. Kuznetsov, Pavel Pevzner |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXII, 283 p. 38 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Pattern recognition systems
Algorithms Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Bioinformatics Automated Pattern Recognition Numerical Analysis Discrete Mathematics in Computer Science Data Science Computational and Systems Biology |
ISBN | 3-319-07566-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Trees -- Regular expressions -- Graphs -- Point sets -- Arrays. |
Record Nr. | UNINA-9910484944403321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the third annual International Conference on Computational Molecular Biology |
Autore | Istrail Sorin |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 1999 |
Descrizione fisica | 1 online resource (332 pages) |
Collana | ACM Conferences |
Soggetto topico |
Biology
Health & Biological Sciences Biophysics |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | RECOMB '99 3rd International Conference on Computational Molecular Biology, Lyon, France - April 11 - 14, 1999 |
Record Nr. | UNINA-9910376438903321 |
Istrail Sorin | ||
[Place of publication not identified], : ACM, 1999 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
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 [[electronic resource] ] : 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings / / edited by Satoru Miyano, Jill Mesirov, Simon Kasif, Sorin Istrail, Pavel Pevzner, Michael Waterman |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XVII, 632 p.) |
Disciplina |
572.015118
570.285 |
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 |
Soggetto non controllato |
Computational molecular biology
RECOMB |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks -- Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks -- Towards an Integrated Protein-Protein Interaction Network -- The Factor Graph Network Model for Biological Systems -- Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution -- Finding Novel Transcripts in High-Resolution Genome-Wide Microarray Data Using the GenRate Model -- Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis -- Keynote -- A Regulatory Network Controlling Drosophila Development -- Keynote -- Yeast Cells as a Discovery Platform for Neurodegenerative Disease -- RIBRA–An Error-Tolerant Algorithm for the NMR Backbone Assignment Problem -- Avoiding Local Optima in Single Particle Reconstruction -- A High-Throughput Approach for Associating microRNAs with Their Activity Conditions -- RNA-RNA Interaction Prediction and Antisense RNA Target Search -- Consensus Folding of Unaligned RNA Sequences Revisited -- Keynote -- Discovery and Annotation of Genetic Modules -- Efficient q-Gram Filters for Finding All ?-Matches over a Given Length -- A Polynomial Time Solvable Formulation of Multiple Sequence Alignment -- A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters -- Reconstruction of Reticulate Networks from Gene Trees -- A Hybrid Micro-Macroevolutionary Approach to Gene Tree Reconstruction -- Constructing a Smallest Refining Galled Phylogenetic Network -- Keynote -- Mapping Molecular Landscapes Inside Cells -- Information Theoretic Approaches to Whole Genome Phylogenies -- Maximum Likelihood of Evolutionary Trees Is Hard -- Graph Theoretical Insights into Evolution of Multidomain Proteins -- Peptide Sequence Tags for Fast Database Search in Mass-Spectrometry -- A Hidden Markov Model Based Scoring Function for Mass Spectrometry Database Search -- EigenMS: De Novo Analysis of Peptide Tandem Mass Spectra by Spectral Graph Partitioning -- Keynote -- Biology as Information -- Using Multiple Alignments to Improve Gene Prediction -- Learning Interpretable SVMs for Biological Sequence Classification -- Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition -- Rapid Protein Side-Chain Packing via Tree Decomposition -- Recognition of Binding Patterns Common to a Set of Protein Structures -- Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions -- Keynote -- Amino Acid Sequence Control of the Folding of the Parallel ?-Helix, the Simplest ?-Sheet Fold -- A Practical Approach to Significance Assessment in Alignment with Gaps -- Alignment of Optical Maps -- Keynote -- Engineering Gene Regulatory Networks: A Reductionist Approach to Systems Biology -- Modeling the Combinatorial Functions of Multiple Transcription Factors -- Predicting Transcription Factor Binding Sites Using Structural Knowledge -- Motif Discovery Through Predictive Modeling of Gene Regulation -- HAPLOFREQ – Estimating Haplotype Frequencies Efficiently -- Improved Recombination Lower Bounds for Haplotype Data -- A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) Problem -- Keynote -- Human Genome Sequence Variation and the Inherited Basis of Common Disease -- Stability of Rearrangement Measures in the Comparison of Genome Sequences -- On Sorting by Translocations. |
Record Nr. | UNISA-996465799203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|