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.
Genome informatics 2009 : proceedings of the 20th international conference : Pacifico Yokohama, Japan, 14-16 December 2009. / / editors: Shinichi Morishita, Sang Yup Lee, Yasubumi Sakakibara
| Genome informatics 2009 : proceedings of the 20th international conference : Pacifico Yokohama, Japan, 14-16 December 2009. / / editors: Shinichi Morishita, Sang Yup Lee, Yasubumi Sakakibara |
| Autore | Shinichi Morishita |
| Pubbl/distr/stampa | London, : Imperial College Press, 2009 |
| Descrizione fisica | xv, 224 p. : ill |
| Disciplina | 572.860285 |
| Altri autori (Persone) |
MorishitaShinichi <1960->
YiSang-yŏp <1964-> SakakibaraYasubumi |
| Collana | Genome informatics series |
| Soggetto topico |
Genomics - Data processing
Bioinformatics |
| Soggetto non controllato |
Computational Systems Biology
Genomics Computational Biology Proteomics Genome Informatics Bioinformatics |
| ISBN |
1-282-76016-5
9786612760167 1-84816-563-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Predicting protein-protein relationships from literature using latent topics / T. Aso & K. Eguchi -- Evaluation of DNA intramolecular interactions for nucleosome positioning in yeast / M. Fernandez ... [et al.] -- Quality control and reproducibility in DNA microarray experiments / A. Fujita ... [et al.] -- Comparative analysis of topological patterns in different mammalian networks / B. Goemann ... [et al.] -- Tools for investigating mechanisms of antigenic variation : new extensions to varDB / C. N. Hayes ... [et al.] -- Localized suffix array and its application to genome mapping problems for paired-end short reads / K. Kimura & A. Koike -- Comparative analysis of aerobic and anaerobic prokaryotes to identify correlation between oxygen requirement and gene-gene functional association patterns / Y. Lin & H. Wu -- Calculation of protein-ligand binding free energy using Smooth Reaction Path Generation (SRPG) method : a comparison of the explicit water model, GB/SA model and docking score function / D. Mitomo ... [et al.] -- Structural insights into the enzyme mechanism of a new family of D-2-hydroxyacid dehydrogenases, a close homolog of 2-Ketopantoate reductase / S. Mondal & K. Mizuguchi -- Comprehensive analysis of sequence-structure relationships in the loop regions of proteins / S. Nakamura & K. Shimizu -- The prediction of local modular structures in a co-expression network based on gene expression datasets / Y. Ogata ... [et al.] -- Gradient-based optimization of hyperparameters for base-pairing profile local alignment kernels / K. Sato, Y. Saito & Y. Sakakibara -- A method for efficient execution of bioinformatics workfiows / J. Seo ... [et al.] -- Development of a new meta-score for protein structure prediction from seven all-atom distance dependent potentials using support vector regression / M. Shirota, T. Ishida & K. Kinoshita -- Refining Markov clustering for protein complex prediction by incorporating core-attachment structure / S. Srihari, K. Ning & H. W. Leong -- An assessment of prediction algorithms for nucleosome positioning / Y. Tanaka & K. Nakai -- Cancer classification using single genes / X. Wang & O. Gotoh -- RECOUNT : expectation maximization based error correction tool for next generation sequencing data / E. Wijaya ... [et al.] -- A new generation of homology search tools based on probabilistic inference / S. R. Eddy -- Representation and analysis of molecular networks involving diseases and drugs / M. Kanehisa -- Systems biotechnology / S. Y. Lee -- Strategies toward CNS-regeneration using induced pluripotent stem cells / H. Okano -- Thinking laterally about genomes / M. A. Ragan. |
| Record Nr. | UNINA-9910346696103321 |
Shinichi Morishita
|
||
| London, : Imperial College Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Grammatical inference : algorithms and applications : 8th international colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006 : proceedings / / Yasubumi Sakakibara ... [et al.] (eds.)
| Grammatical inference : algorithms and applications : 8th international colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006 : proceedings / / Yasubumi Sakakibara ... [et al.] (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XII, 359 p.) |
| Disciplina | 005.13/1 |
| Altri autori (Persone) | SakakibaraYasubumi |
| Collana |
LNCS sublibrary. SL 7, Artificial intelligence
Lecture notes in computer science. Lecture notes in artificial intelligence |
| Soggetto topico |
Formal languages
Logic, Symbolic and mathematical |
| ISBN | 3-540-45265-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Parsing Without Grammar Rules -- Classification of Biological Sequences with Kernel Methods -- Regular Papers -- Identification in the Limit of Systematic-Noisy Languages -- Ten Open Problems in Grammatical Inference -- Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data -- PAC-Learning Unambiguous NTS Languages -- Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets -- Variational Bayesian Grammar Induction for Natural Language -- Stochastic Analysis of Lexical and Semantic Enhanced Structural Language Model -- Using Pseudo-stochastic Rational Languages in Probabilistic Grammatical Inference -- Learning Analysis by Reduction from Positive Data -- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time -- Planar Languages and Learnability -- A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data -- Protein Motif Prediction by Grammatical Inference -- Grammatical Inference in Practice: A Case Study in the Biomedical Domain -- Inferring Grammar Rules of Programming Language Dialects -- The Tenjinno Machine Translation Competition -- Large Scale Inference of Deterministic Transductions: Tenjinno Problem 1 -- A Discriminative Model of Stochastic Edit Distance in the Form of a Conditional Transducer -- Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples -- Learning Multiplicity Tree Automata -- Learning DFA from Correction and Equivalence Queries -- Using MDL for Grammar Induction -- Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses -- Learning Deterministic DEC Grammars Is Learning Rational Numbers -- Iso-array Acceptors and Learning -- Poster Papers -- A Merging States Algorithm for Inference of RFSAs -- Query-Based Learning of XPath Expressions -- Learning Finite-State Machines from Inexperienced Teachers -- Suprasymbolic Grammar Induction by Recurrent Self-Organizing Maps -- Graph-Based Structural Data Mining in Cognitive Pattern Interpretation -- Constructing Song Syntax by Automata Induction -- Learning Reversible Languages with Terminal Distinguishability -- Grammatical Inference for Syntax-Based Statistical Machine Translation. |
| Altri titoli varianti | ICGI 2006 |
| Record Nr. | UNINA-9910768456803321 |
| Berlin ; ; New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / / edited by Georgios Paliouras, Yasubumi Sakakibara
| Grammatical Inference: Algorithms and Applications [[electronic resource] ] : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / / edited by Georgios Paliouras, Yasubumi Sakakibara |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 296 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-30195-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. |
| Record Nr. | UNISA-996465772603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Grammatical Inference: Algorithms and Applications : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / / edited by Georgios Paliouras, Yasubumi Sakakibara
| Grammatical Inference: Algorithms and Applications : 7th International Colloquium, ICGI 2004, Athens, Greece, October 11-13, 2004. Proceedings / / edited by Georgios Paliouras, Yasubumi Sakakibara |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XII, 296 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Artificial intelligence Mathematical logic Computer logic Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-540-30195-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Learning and Mathematics -- Learning Finite-State Models for Machine Translation -- The Omphalos Context-Free Grammar Learning Competition -- Regular Papers -- Mutually Compatible and Incompatible Merges for the Search of the Smallest Consistent DFA -- Faster Gradient Descent Training of Hidden Markov Models, Using Individual Learning Rate Adaptation -- Learning Mild Context-Sensitiveness: Toward Understanding Children’s Language Learning -- Learnability of Pregroup Grammars -- A Markovian Approach to the Induction of Regular String Distributions -- Learning Node Selecting Tree Transducer from Completely Annotated Examples -- Identifying Clusters from Positive Data -- Introducing Domain and Typing Bias in Automata Inference -- Analogical Equations in Sequences: Definition and Resolution -- Representing Languages by Learnable Rewriting Systems -- A Divide-and-Conquer Approach to Acquire Syntactic Categories -- Grammatical Inference Using Suffix Trees -- Learning Stochastic Finite Automata -- Navigation Pattern Discovery Using Grammatical Inference -- A Corpus-Driven Context-Free Approximation of Head-Driven Phrase Structure Grammar -- Partial Learning Using Link Grammars Data -- eg-GRIDS: Context-Free Grammatical Inference from Positive Examples Using Genetic Search -- The Boisdale Algorithm – An Induction Method for a Subclass of Unification Grammar from Positive Data -- Learning Stochastic Deterministic Regular Languages -- Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data -- Poster Papers -- Learning Syntax from Function Words -- Running FCRPNI in Efficient Time for Piecewise and Right Piecewise Testable Languages -- Extracting Minimum Length Document Type Definitions Is NP-Hard -- Learning Distinguishable Linear Grammars from Positive Data -- Extending Incremental Learning of Context Free Grammars in Synapse -- Identifying Left-Right Deterministic Linear Languages -- Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples -- An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries. |
| Record Nr. | UNINA-9910144343803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||