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.
Advances in Bioinformatics and Computational Biology [[electronic resource] ] : 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31--September 3, 2010, Proceedings / / edited by Carlos E. Ferreira, Satoru Miyano, Peter F. Stadler
| Advances in Bioinformatics and Computational Biology [[electronic resource] ] : 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31--September 3, 2010, Proceedings / / edited by Carlos E. Ferreira, Satoru Miyano, Peter F. Stadler |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (IX, 81 p. 18 illus.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Life sciences
Computer programming Data structures (Computer science) Artificial intelligence Computers Algorithms Life Sciences, general Programming Techniques Data Structures and Information Theory Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-642-15060-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Full Papers -- Evolution of the Long Non-coding RNAs MALAT1 and MEN?/? -- Granger Causality in Systems Biology: Modeling Gene Networks in Time Series Microarray Data Using Vector Autoregressive Models -- Semi-supervised Approach for Finding Cancer Sub-classes on Gene Expression Data -- Bounds on the Transposition Distance for Lonely Permutations -- Insights on Haplotype Inference on Large Genotype Datasets -- Extended Abstracts -- An SVM Model Based on Physicochemical Properties to Predict Antimicrobial Activity from Protein Sequences with Cysteine Knot Motifs -- Enabling Annotation Provenance in Bioinformatics Workflow Applications -- BAT: A New Biclustering Analysis Toolbox -- Detection of Protein Domains in Eukaryotic Genome Sequences -- Discretization of Flexible-Receptor Docking Data. |
| Record Nr. | UNISA-996466288303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Advances in bioinformatics and computational biology : 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31-September 3, 2010 : proceedings / / Carlos E. Ferreira, Satoru Miyano, Peter F. Stadler (eds.)
| Advances in bioinformatics and computational biology : 5th Brazilian Symposium on Bioinformatics, BSB 2010, Rio de Janeiro, Brazil, August 31-September 3, 2010 : proceedings / / Carlos E. Ferreira, Satoru Miyano, Peter F. Stadler (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (IX, 81 p. 18 illus.) |
| Disciplina | 570.285 |
| Altri autori (Persone) |
FerreiraCarlos E
MiyanoSatoru StadlerPeter F. <1965-> |
| Collana |
LNCS sublibrary. SL 8, Bioinformatics
Lecture notes in computer science,Lecture notes in bioinformatics |
| Soggetto topico |
Bioinformatics
Computational biology |
| ISBN | 3-642-15060-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Full Papers -- Evolution of the Long Non-coding RNAs MALAT1 and MEN?/? -- Granger Causality in Systems Biology: Modeling Gene Networks in Time Series Microarray Data Using Vector Autoregressive Models -- Semi-supervised Approach for Finding Cancer Sub-classes on Gene Expression Data -- Bounds on the Transposition Distance for Lonely Permutations -- Insights on Haplotype Inference on Large Genotype Datasets -- Extended Abstracts -- An SVM Model Based on Physicochemical Properties to Predict Antimicrobial Activity from Protein Sequences with Cysteine Knot Motifs -- Enabling Annotation Provenance in Bioinformatics Workflow Applications -- BAT: A New Biclustering Analysis Toolbox -- Detection of Protein Domains in Eukaryotic Genome Sequences -- Discretization of Flexible-Receptor Docking Data. |
| Altri titoli varianti | BSB 2010 |
| Record Nr. | UNINA-9910484058803321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
| Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 458 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer communication systems Computer graphics Computer mathematics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Computer Graphics Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-49633-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the “matching with consumption” model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta. |
| Record Nr. | UNISA-996465977303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Proceedings of the 6th Asia-Pacific Bioinformatics Conference [[electronic resource] ] : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu
| Proceedings of the 6th Asia-Pacific Bioinformatics Conference [[electronic resource] ] : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (413 p.) |
| Disciplina | 572.8633 |
| Altri autori (Persone) |
AkutsuTatsuya <1962->
BrazmaAlvis MiyanoSatoru |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Bioinformatics
Biology - Data processing |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-86579-6
9786611865795 1-84816-109-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; APBC 2008 Organization; Program Committee; Additional Reviewers; Keynote Papers; Recent Progress in Phylogenetic Combinatorics Andreas Dress; 1. Background; 2. Discussion; References; KEGG for Medical and Pharmaceutical Applications Minoru Kanehisa; Protein Interactions Extracted from Genomes and Papers Alfonso Valencia; Contributed Papers; String Kernels with Feature Selection for SVM Protein Classification Wen-Yun Yang and Bao-Liang Lu; 1. Introduction; 2. A string kernel framework; 2.1. Notations; 2.2. Pramework definition; 2.3. Relations with existing string kernels
3. Efficient computation3.1. Tree data structure with leaf links; 3.2. Leaf traversal algorithm; 4. Selecting feature groups and weights; 4.1. Reduction of spectrum string kernel; 4.2. Statistically selecting feature groups; 5. Experiment; 6. Discussion and future work; Acknowledgments; References; Predicting Nucleolar Proteins Using Support-Vector Machines Mikael Bod&.; 1. Introduction; 2. Background; 3. Methods; 3.1. Data set; 3.2. Model; 4. Results; 5 . Conclusion; Acknowledgments; References Supervised Ensembles of Prediction Methods for Subcellular Localization Johannes Apfalg, Jing Gong, Hans-Peter Kriegel, Alexey Pryakhin, Tiandi Wei and Arthur Zimek1. Introduction; 2. Survey on Prominent Prediction Methods for Subcellular Localization; 2.1. Amino Acid Composition; 2.2. Sorting Signals; 2.3. Homology; 2.4. Hybrid Methods; 3. Ensemble Methods; 3.1. Theory; 3.2. Selection of Base Methods for Ensembles; 3.3. Ensemble Method Based on a Voting Schema; 3.4. Ensemble Method Based on Decision Trees; 4. Evaluation; 5. Conclusions; References Chemical Compound Classification with Automatically Mined Structure Patterns Aaron M. Smalter, J. Huan and Gerald H. Lushington1. Introduction; 2. Related Work; 2.1. Marginalized and Optimal Assignment Graph Kernels; 2.2. Frequent Subgraph Mining; 3. Background; 3.1. Chemical Structure; 4. Algorithm Design; 4.1. Structure Pattern Mining; 4.2. Optimal Assignment Kernel; 4.3. Reduced Graph Representation; 4.4. Pattern-based Descriptors; 5. Experimental Study; 5.1. Data Sets; 5.2. Methods; 5.3. Results; 6. Conclusions; Acknowledgments; References Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers Alireza Hadj Khodabakhshi, Jdn Mariuch, Arash Rafiey and Arvind Gupta1. Introduction; 2. Definitions; 2.1. Hydropho bic-polar- c ysteine (HP C) model; 2.2. Snake structures; 2.3. The strong HPC model; 3. Proof techniques; 3.1. Saturated folds; 3.2. 2DHPSolver: a semi-automatic prover; 4. Stability of the snake structures; 5. Conclusions; References; Discrimination of Native Folds Using Network Properties of Protein Structures Alper Kiiciikural, 0. Ug'ur Sezerman and Aytiil Ercal; 1 Introduction 2 Methods |
| Record Nr. | UNINA-9910458498403321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 6th Asia-Pacific Bioinformatics Conference [[electronic resource] ] : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu
| Proceedings of the 6th Asia-Pacific Bioinformatics Conference [[electronic resource] ] : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (413 p.) |
| Disciplina | 572.8633 |
| Altri autori (Persone) |
AkutsuTatsuya <1962->
BrazmaAlvis MiyanoSatoru |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Bioinformatics
Biology - Data processing |
| ISBN |
1-281-86579-6
9786611865795 1-84816-109-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; APBC 2008 Organization; Program Committee; Additional Reviewers; Keynote Papers; Recent Progress in Phylogenetic Combinatorics Andreas Dress; 1. Background; 2. Discussion; References; KEGG for Medical and Pharmaceutical Applications Minoru Kanehisa; Protein Interactions Extracted from Genomes and Papers Alfonso Valencia; Contributed Papers; String Kernels with Feature Selection for SVM Protein Classification Wen-Yun Yang and Bao-Liang Lu; 1. Introduction; 2. A string kernel framework; 2.1. Notations; 2.2. Pramework definition; 2.3. Relations with existing string kernels
3. Efficient computation3.1. Tree data structure with leaf links; 3.2. Leaf traversal algorithm; 4. Selecting feature groups and weights; 4.1. Reduction of spectrum string kernel; 4.2. Statistically selecting feature groups; 5. Experiment; 6. Discussion and future work; Acknowledgments; References; Predicting Nucleolar Proteins Using Support-Vector Machines Mikael Bod&.; 1. Introduction; 2. Background; 3. Methods; 3.1. Data set; 3.2. Model; 4. Results; 5 . Conclusion; Acknowledgments; References Supervised Ensembles of Prediction Methods for Subcellular Localization Johannes Apfalg, Jing Gong, Hans-Peter Kriegel, Alexey Pryakhin, Tiandi Wei and Arthur Zimek1. Introduction; 2. Survey on Prominent Prediction Methods for Subcellular Localization; 2.1. Amino Acid Composition; 2.2. Sorting Signals; 2.3. Homology; 2.4. Hybrid Methods; 3. Ensemble Methods; 3.1. Theory; 3.2. Selection of Base Methods for Ensembles; 3.3. Ensemble Method Based on a Voting Schema; 3.4. Ensemble Method Based on Decision Trees; 4. Evaluation; 5. Conclusions; References Chemical Compound Classification with Automatically Mined Structure Patterns Aaron M. Smalter, J. Huan and Gerald H. Lushington1. Introduction; 2. Related Work; 2.1. Marginalized and Optimal Assignment Graph Kernels; 2.2. Frequent Subgraph Mining; 3. Background; 3.1. Chemical Structure; 4. Algorithm Design; 4.1. Structure Pattern Mining; 4.2. Optimal Assignment Kernel; 4.3. Reduced Graph Representation; 4.4. Pattern-based Descriptors; 5. Experimental Study; 5.1. Data Sets; 5.2. Methods; 5.3. Results; 6. Conclusions; Acknowledgments; References Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers Alireza Hadj Khodabakhshi, Jdn Mariuch, Arash Rafiey and Arvind Gupta1. Introduction; 2. Definitions; 2.1. Hydropho bic-polar- c ysteine (HP C) model; 2.2. Snake structures; 2.3. The strong HPC model; 3. Proof techniques; 3.1. Saturated folds; 3.2. 2DHPSolver: a semi-automatic prover; 4. Stability of the snake structures; 5. Conclusions; References; Discrimination of Native Folds Using Network Properties of Protein Structures Alper Kiiciikural, 0. Ug'ur Sezerman and Aytiil Ercal; 1 Introduction 2 Methods |
| Record Nr. | UNINA-9910784519503321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 6th Asia-Pacific Bioinformatics Conference : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu
| Proceedings of the 6th Asia-Pacific Bioinformatics Conference : Kyoto, Japan, 14-17 January 2008 / / editors, Alvis Brazma, Satoru Miyano, Tatsuya Akutsu |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | London, : Imperial College Press |
| Descrizione fisica | 1 online resource (413 p.) |
| Disciplina | 572.8633 |
| Altri autori (Persone) |
AkutsuTatsuya <1962->
BrazmaAlvis MiyanoSatoru |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Bioinformatics
Biology - Data processing |
| ISBN |
1-281-86579-6
9786611865795 1-84816-109-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
CONTENTS; Preface; APBC 2008 Organization; Program Committee; Additional Reviewers; Keynote Papers; Recent Progress in Phylogenetic Combinatorics Andreas Dress; 1. Background; 2. Discussion; References; KEGG for Medical and Pharmaceutical Applications Minoru Kanehisa; Protein Interactions Extracted from Genomes and Papers Alfonso Valencia; Contributed Papers; String Kernels with Feature Selection for SVM Protein Classification Wen-Yun Yang and Bao-Liang Lu; 1. Introduction; 2. A string kernel framework; 2.1. Notations; 2.2. Pramework definition; 2.3. Relations with existing string kernels
3. Efficient computation3.1. Tree data structure with leaf links; 3.2. Leaf traversal algorithm; 4. Selecting feature groups and weights; 4.1. Reduction of spectrum string kernel; 4.2. Statistically selecting feature groups; 5. Experiment; 6. Discussion and future work; Acknowledgments; References; Predicting Nucleolar Proteins Using Support-Vector Machines Mikael Bod&.; 1. Introduction; 2. Background; 3. Methods; 3.1. Data set; 3.2. Model; 4. Results; 5 . Conclusion; Acknowledgments; References Supervised Ensembles of Prediction Methods for Subcellular Localization Johannes Apfalg, Jing Gong, Hans-Peter Kriegel, Alexey Pryakhin, Tiandi Wei and Arthur Zimek1. Introduction; 2. Survey on Prominent Prediction Methods for Subcellular Localization; 2.1. Amino Acid Composition; 2.2. Sorting Signals; 2.3. Homology; 2.4. Hybrid Methods; 3. Ensemble Methods; 3.1. Theory; 3.2. Selection of Base Methods for Ensembles; 3.3. Ensemble Method Based on a Voting Schema; 3.4. Ensemble Method Based on Decision Trees; 4. Evaluation; 5. Conclusions; References Chemical Compound Classification with Automatically Mined Structure Patterns Aaron M. Smalter, J. Huan and Gerald H. Lushington1. Introduction; 2. Related Work; 2.1. Marginalized and Optimal Assignment Graph Kernels; 2.2. Frequent Subgraph Mining; 3. Background; 3.1. Chemical Structure; 4. Algorithm Design; 4.1. Structure Pattern Mining; 4.2. Optimal Assignment Kernel; 4.3. Reduced Graph Representation; 4.4. Pattern-based Descriptors; 5. Experimental Study; 5.1. Data Sets; 5.2. Methods; 5.3. Results; 6. Conclusions; Acknowledgments; References Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers Alireza Hadj Khodabakhshi, Jdn Mariuch, Arash Rafiey and Arvind Gupta1. Introduction; 2. Definitions; 2.1. Hydropho bic-polar- c ysteine (HP C) model; 2.2. Snake structures; 2.3. The strong HPC model; 3. Proof techniques; 3.1. Saturated folds; 3.2. 2DHPSolver: a semi-automatic prover; 4. Stability of the snake structures; 5. Conclusions; References; Discrimination of Native Folds Using Network Properties of Protein Structures Alper Kiiciikural, 0. Ug'ur Sezerman and Aytiil Ercal; 1 Introduction 2 Methods |
| Altri titoli varianti | Proceedings of the Sixth Asia-Pacific Bioinformatics Conference |
| Record Nr. | UNINA-9910822764803321 |
| London, : Imperial College Press | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the fourth annual International Conference on Computational Molecular Biology
| Proceedings of the fourth annual International Conference on Computational Molecular Biology |
| Autore | Shamir Ron |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2000 |
| Descrizione fisica | 1 online resource (329 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 | Proceedings of the fourth annual International Conference on Computational Molecular Biology |
| Record Nr. | UNINA-9910376220403321 |
Shamir Ron
|
||
| [Place of publication not identified], : ACM, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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
| 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 | ||
| ||
Research in computational molecular biology : 9th annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005 : proceedings / / Satoru Miyano ... [et al.] (eds.)
| Research in computational molecular biology : 9th annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005 : proceedings / / Satoru Miyano ... [et al.] (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XVII, 632 p.) |
| Disciplina | 572.015118 |
| Altri autori (Persone) | MiyanoSatoru |
| Collana | Lecture notes in computer science. Lecture notes in bioinformatics |
| Soggetto topico |
Molecular biology - Mathematical models
Molecular biology Biochemistry - Mathematical models |
| 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. |
| Altri titoli varianti | RECOMB 2005 |
| Record Nr. | UNINA-9910767560003321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||