top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithms for Next-Generation Sequencing Data : Techniques, Approaches, and Applications / / edited by Mourad Elloumi
Algorithms for Next-Generation Sequencing Data : Techniques, Approaches, and Applications / / edited by Mourad Elloumi
Edizione [1st ed. 2017.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Descrizione fisica 1 online resource (XIII, 355 p. 108 illus., 3 illus. in color.)
Disciplina 570.285
Soggetto topico Bioinformatics
Biomathematics
Algorithms
Computational Biology/Bioinformatics
Mathematical and Computational Biology
Algorithm Analysis and Problem Complexity
ISBN 3-319-59826-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910254843603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms in computational molecular biology [[electronic resource] ] : techniques, approaches and applications / / edited by Mourad Elloumi, Albert Y. Zomaya
Algorithms in computational molecular biology [[electronic resource] ] : techniques, approaches and applications / / edited by Mourad Elloumi, Albert Y. Zomaya
Pubbl/distr/stampa Hoboken, New Jersey : , : John Wiley & Sons, , 2011
Descrizione fisica 1 online resource (1085 p.)
Disciplina 572.80285
Altri autori (Persone) ElloumiMourad
ZomayaAlbert Y
Collana Wiley series on bioinformatics
Soggetto topico Biophysics - Mathematical models
ISBN 1-282-93963-7
9786612939631
0-470-89209-9
0-470-89210-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALGORITHMS INCOMPUTATIONALMOLECULAR BIOLOGY; CONTENTS; PREFACE; CONTRIBUTORS; I STRINGS PROCESSING AND APPLICATION TO BIOLOGICAL SEQUENCES; 1 STRING DATA STRUCTURES FOR COMPUTATIONAL MOLECULAR BIOLOGY; 1.1 Introduction; 1.2 Main String Indexing Data Structures; 1.2.1 Suffix Trees; 1.2.2 Suffix Arrays; 1.3 Index Structures for Weighted Strings; 1.4 Index Structures for Indeterminate Strings; 1.5 String Data Structures in Memory Hierarchies; 1.6 Conclusions; References; 2 EFFICIENT RESTRICTED-CASE ALGORITHMS FOR PROBLEMS IN COMPUTATIONAL BIOLOGY; 2.1 The Need for Special Cases
2.2 Assessing Efficient Solvability Options for General Problems and Special Cases2.3 String and Sequence Problems; 2.4 Shortest Common Superstring; 2.4.1 Solving the General Problem; 2.4.2 Special Case: SCSt for Short Strings Over Small Alphabets; 2.4.3 Discussion; 2.5 Longest Common Subsequence; 2.5.1 Solving the General Problem; 2.5.2 Special Case: LCS of Similar Sequences; 2.5.3 Special Case: LCS Under Symbol-Occurrence Restrictions; 2.5.4 Discussion; 2.6 Common Approximate Substring; 2.6.1 Solving the General Problem; 2.6.2 Special Case: Common Approximate String; 2.6.3 Discussion
2.7 ConclusionReferences; 3 FINITE AUTOMATA IN PATTERN MATCHING; 3.1 Introduction; 3.1.1 Preliminaries; 3.2 Direct Use of DFA in Stringology; 3.2.1 Forward Automata; 3.2.2 Degenerate Strings; 3.2.3 Indexing Automata; 3.2.4 Filtering Automata; 3.2.5 Backward Automata; 3.2.6 Automata with Fail Function; 3.3 NFA Simulation; 3.3.1 Basic Simulation Method; 3.3.2 Bit Parallelism; 3.3.3 Dynamic Programming; 3.3.4 Basic Simulation Method with Deterministic State Cache; 3.4 Finite Automaton as Model of Computation; 3.5 Finite Automata Composition; 3.6 Summary; References
4 NEW DEVELOPMENTS IN PROCESSING OF DEGENERATE SEQUENCES4.1 Introduction; 4.1.1 Degenerate Primer Design Problem; 4.2 Background; 4.3 Basic Definitions; 4.4 Repetitive Structures in Degenerate Strings; 4.4.1 Using the Masking Technique; 4.4.2 Computing the Smallest Cover of the Degenerate String x; 4.4.3 Computing Maximal Local Covers of x; 4.4.4 Computing All Covers of x; 4.4.5 Computing the Seeds of x; 4.5 Conservative String Covering in Degenerate Strings; 4.5.1 Finding Constrained Pattern p in Degenerate String T; 4.5.2 Computing ?-Conservative Covers of Degenerate Strings
4.5.3 Computing ?-Conservative Seeds of Degenerate Strings4.6 Conclusion; References; 5 EXACT SEARCH ALGORITHMS FOR BIOLOGICAL SEQUENCES; 5.1 Introduction; 5.2 Single Pattern Matching Algorithms; 5.2.1 Algorithms for DNA Sequences; 5.2.2 Algorithms for Amino Acids; 5.3 Algorithms for Multiple Patterns; 5.3.1 Trie-Based Algorithms; 5.3.2 Filtering Algorithms; 5.3.3 Other Algorithms; 5.4 Application of Exact Set Pattern Matching for Read Mapping; 5.4.1 MPSCAN: An Efficient Exact Set Pattern Matching Tool for DNA/RNA Sequences; 5.4.2 Other Solutions for Mapping Reads
5.4.3 Comparison of Mapping Solutions
Record Nr. UNINA-9910139396103321
Hoboken, New Jersey : , : John Wiley & Sons, , 2011
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms in computational molecular biology : techniques, approaches and applications / / edited by Mourad Elloumi, Albert Y. Zomaya
Algorithms in computational molecular biology : techniques, approaches and applications / / edited by Mourad Elloumi, Albert Y. Zomaya
Pubbl/distr/stampa Hoboken, N.J., : Wiley, 2011
Descrizione fisica 1 online resource (1085 p.)
Disciplina 572.80285
Altri autori (Persone) ElloumiMourad
ZomayaAlbert Y
Collana Wiley series on bioinformatics
Soggetto topico Biophysics - Mathematical models
ISBN 9786612939631
9781282939639
1282939637
9780470892091
0470892099
9780470892107
0470892102
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ALGORITHMS INCOMPUTATIONALMOLECULAR BIOLOGY; CONTENTS; PREFACE; CONTRIBUTORS; I STRINGS PROCESSING AND APPLICATION TO BIOLOGICAL SEQUENCES; 1 STRING DATA STRUCTURES FOR COMPUTATIONAL MOLECULAR BIOLOGY; 1.1 Introduction; 1.2 Main String Indexing Data Structures; 1.2.1 Suffix Trees; 1.2.2 Suffix Arrays; 1.3 Index Structures for Weighted Strings; 1.4 Index Structures for Indeterminate Strings; 1.5 String Data Structures in Memory Hierarchies; 1.6 Conclusions; References; 2 EFFICIENT RESTRICTED-CASE ALGORITHMS FOR PROBLEMS IN COMPUTATIONAL BIOLOGY; 2.1 The Need for Special Cases
2.2 Assessing Efficient Solvability Options for General Problems and Special Cases2.3 String and Sequence Problems; 2.4 Shortest Common Superstring; 2.4.1 Solving the General Problem; 2.4.2 Special Case: SCSt for Short Strings Over Small Alphabets; 2.4.3 Discussion; 2.5 Longest Common Subsequence; 2.5.1 Solving the General Problem; 2.5.2 Special Case: LCS of Similar Sequences; 2.5.3 Special Case: LCS Under Symbol-Occurrence Restrictions; 2.5.4 Discussion; 2.6 Common Approximate Substring; 2.6.1 Solving the General Problem; 2.6.2 Special Case: Common Approximate String; 2.6.3 Discussion
2.7 ConclusionReferences; 3 FINITE AUTOMATA IN PATTERN MATCHING; 3.1 Introduction; 3.1.1 Preliminaries; 3.2 Direct Use of DFA in Stringology; 3.2.1 Forward Automata; 3.2.2 Degenerate Strings; 3.2.3 Indexing Automata; 3.2.4 Filtering Automata; 3.2.5 Backward Automata; 3.2.6 Automata with Fail Function; 3.3 NFA Simulation; 3.3.1 Basic Simulation Method; 3.3.2 Bit Parallelism; 3.3.3 Dynamic Programming; 3.3.4 Basic Simulation Method with Deterministic State Cache; 3.4 Finite Automaton as Model of Computation; 3.5 Finite Automata Composition; 3.6 Summary; References
4 NEW DEVELOPMENTS IN PROCESSING OF DEGENERATE SEQUENCES4.1 Introduction; 4.1.1 Degenerate Primer Design Problem; 4.2 Background; 4.3 Basic Definitions; 4.4 Repetitive Structures in Degenerate Strings; 4.4.1 Using the Masking Technique; 4.4.2 Computing the Smallest Cover of the Degenerate String x; 4.4.3 Computing Maximal Local Covers of x; 4.4.4 Computing All Covers of x; 4.4.5 Computing the Seeds of x; 4.5 Conservative String Covering in Degenerate Strings; 4.5.1 Finding Constrained Pattern p in Degenerate String T; 4.5.2 Computing ?-Conservative Covers of Degenerate Strings
4.5.3 Computing ?-Conservative Seeds of Degenerate Strings4.6 Conclusion; References; 5 EXACT SEARCH ALGORITHMS FOR BIOLOGICAL SEQUENCES; 5.1 Introduction; 5.2 Single Pattern Matching Algorithms; 5.2.1 Algorithms for DNA Sequences; 5.2.2 Algorithms for Amino Acids; 5.3 Algorithms for Multiple Patterns; 5.3.1 Trie-Based Algorithms; 5.3.2 Filtering Algorithms; 5.3.3 Other Algorithms; 5.4 Application of Exact Set Pattern Matching for Read Mapping; 5.4.1 MPSCAN: An Efficient Exact Set Pattern Matching Tool for DNA/RNA Sequences; 5.4.2 Other Solutions for Mapping Reads
5.4.3 Comparison of Mapping Solutions
Record Nr. UNINA-9910825591603321
Hoboken, N.J., : Wiley, 2011
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Biological knowledge discovery handbook : preprocessing, mining and postprocessing of biological data / / edited by Mourad Elloumi, Albert Y. Zomaya ; cover Design, Michael Rutkowski ; Jad Abbass [and one hundred twenty eight others], contributors
Biological knowledge discovery handbook : preprocessing, mining and postprocessing of biological data / / edited by Mourad Elloumi, Albert Y. Zomaya ; cover Design, Michael Rutkowski ; Jad Abbass [and one hundred twenty eight others], contributors
Autore Elloumi Mourad
Pubbl/distr/stampa Hoboken, New Jersey : , : Wiley, , 2014
Descrizione fisica 1 online resource (1192 p.)
Disciplina 572.80285
Altri autori (Persone) ElloumiMourad
RutkowskiMichael
AbbassJad
Collana Wiley Series in Bioinformatics : Computational Techniques and Engineering
Soggetto topico Bioinformatics
Computational biology
Data mining
ISBN 1-118-85372-5
1-118-61715-0
1-118-61711-8
Classificazione COM021040
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto BIOLOGICAL KNOWLEDGE DISCOVERY HANDBOOK: Preprocessing, Mining, and Postprocessing of Biological Data; CONTENTS; PREFACE; CONTRIBUTORS; SECTION I: BIOLOGICAL DATA PREPROCESSING; PART A: BIOLOGICAL DATA MANAGEMENT; 1 GENOME AND TRANSCRIPTOME SEQUENCE DATABASES FOR DISCOVERY, STORAGE, AND REPRESENTATION OF ALTERNATIVE SPLICING EVENTS; 1.1 INTRODUCTION; 1.2 SPLICING; 1.2.1 Mechanism of Splicing; 1.2.2 Regulation of Splicing; 1.3 ALTERNATIVE SPLICING; 1.3.1 Introduction to Alternative Splicing; 1.3.2 Mechanism of Alternative Splicing; 1.3.3 Regulation of Alternative Splicing
1.3.4 Evolution and Conservation of Splicing and Alternative Splicing 1.4 ALTERNATIVE SPLICING DATABASES; 1.4.1 Genomic and Transcriptomic Sequence Analyses; 1.4.2 Literature Overview of Various Alternative Splicing Databases; 1.4.3 SDBs; 1.5 DATA MINING FROM ALTERNATIVE SPLICING DATABASES; 1.5.1 Implementation of dbASQ and Utility of SDBs; 1.5.2 Identification of Transcript-Initial and Transcript-Terminal Variation; ACKNOWLEDGMENTS; WEB RESOURCES; REFERENCES; 2 CLEANING, INTEGRATING, AND WAREHOUSING GENOMIC DATA FROM BIOMEDICAL RESOURCES; 2.1 INTRODUCTION; 2.2 RELATED WORK
2.3 TYPOLOGY OF DATA QUALITY PROBLEMS IN BIOMEDICAL RESOURCES 2.4 CLEANING, INTEGRATING, AND WAREHOUSING BIOMEDICAL DATA; 2.4.1 Lessons Learned from Integrating and Warehousing Biomedical Data on Liver Genes and Diseases; 2.4.2 Data Quality-Aware Solutions; 2.4.3 Biological Entity Resolution and Record Linkage; 2.4.4 Ontology-Based Approaches; 2.5 CONCLUSIONS AND PERSPECTIVES; WEB RESOURCES; REFERENCES; 3 CLEANSING OF MASS SPECTROMETRY DATA FOR PROTEIN IDENTIFICATION AND QUANTIFICATION; 3.1 INTRODUCTION; 3.2 PREPROCESSING APPROACH FOR IMPROVING PROTEIN IDENTIFICATION; 3.2.1 Existing Approaches
3.2.2 New Dynamic Wavelet-Based Spectra Preprocessing Method 3.3 IDENTIFICATION FILTERING APPROACH FOR IMPROVING PROTEIN IDENTIFICATION; 3.3.1 Existing Approaches; 3.3.2 New Target-Decoy Approach for Improving Protein Identification; 3.4 EVALUATION RESULTS; 3.4.1 Evaluation of New Proprocessing Method; 3.4.2 Evaluation of New Identification Filtering Method; 3.5 CONCLUSION; REFERENCES; 4 FILTERING PROTEIN-PROTEIN INTERACTIONS BY INTEGRATION OF ONTOLOGY DATA; 4.1 INTRODUCTION; 4.2 EVALUATION OF SEMANTIC SIMILARITY; 4.2.1 Gene Ontology; 4.2.2 Survey of Semantic Similarity Measures
4.2.3 Correlation with Functional Categorizations 4.3 IDENTIFICATION OF FALSE PROTEIN-PROTEIN INTERACTION DATA; 4.3.1 Classification Method; 4.3.2 Accuracy of PPI Classification; 4.3.3 Reliability of PPI Data; 4.4 CONCLUSION; REFERENCES; PART B: BIOLOGICAL DATA MODELING; 5 COMPLEXITY AND SYMMETRIES IN DNA SEQUENCES; 5.1 INTRODUCTION; 5.2 ARCHAEA; 5.3 PATTERNS ON INDICATOR MATRIX; 5.3.1 Indicator Matrix; 5.3.2 Test Sequences; 5.4 MEASURE OF COMPLEXITY AND INFORMATION; 5.4.1 Complexity; 5.4.2 Fractal Dimension; 5.4.3 Entropy; 5.5 COMPLEX ROOT REPRESENTATION OF DNA WORDS
5.5.1 Pseudorandom Sequence on Unit Circle
Record Nr. UNINA-9910138969003321
Elloumi Mourad  
Hoboken, New Jersey : , : Wiley, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Biological knowledge discovery handbook : preprocessing, mining and postprocessing of biological data / / edited by Mourad Elloumi, Albert Y. Zomaya ; cover Design, Michael Rutkowski ; Jad Abbass [and one hundred twenty eight others], contributors
Biological knowledge discovery handbook : preprocessing, mining and postprocessing of biological data / / edited by Mourad Elloumi, Albert Y. Zomaya ; cover Design, Michael Rutkowski ; Jad Abbass [and one hundred twenty eight others], contributors
Autore Elloumi Mourad
Pubbl/distr/stampa Hoboken, New Jersey : , : Wiley, , 2014
Descrizione fisica 1 online resource (1192 p.)
Disciplina 572.80285
Altri autori (Persone) ElloumiMourad
RutkowskiMichael
AbbassJad
Collana Wiley Series in Bioinformatics : Computational Techniques and Engineering
Soggetto topico Bioinformatics
Computational biology
Data mining
ISBN 1-118-85372-5
1-118-61715-0
1-118-61711-8
Classificazione COM021040
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto BIOLOGICAL KNOWLEDGE DISCOVERY HANDBOOK: Preprocessing, Mining, and Postprocessing of Biological Data; CONTENTS; PREFACE; CONTRIBUTORS; SECTION I: BIOLOGICAL DATA PREPROCESSING; PART A: BIOLOGICAL DATA MANAGEMENT; 1 GENOME AND TRANSCRIPTOME SEQUENCE DATABASES FOR DISCOVERY, STORAGE, AND REPRESENTATION OF ALTERNATIVE SPLICING EVENTS; 1.1 INTRODUCTION; 1.2 SPLICING; 1.2.1 Mechanism of Splicing; 1.2.2 Regulation of Splicing; 1.3 ALTERNATIVE SPLICING; 1.3.1 Introduction to Alternative Splicing; 1.3.2 Mechanism of Alternative Splicing; 1.3.3 Regulation of Alternative Splicing
1.3.4 Evolution and Conservation of Splicing and Alternative Splicing 1.4 ALTERNATIVE SPLICING DATABASES; 1.4.1 Genomic and Transcriptomic Sequence Analyses; 1.4.2 Literature Overview of Various Alternative Splicing Databases; 1.4.3 SDBs; 1.5 DATA MINING FROM ALTERNATIVE SPLICING DATABASES; 1.5.1 Implementation of dbASQ and Utility of SDBs; 1.5.2 Identification of Transcript-Initial and Transcript-Terminal Variation; ACKNOWLEDGMENTS; WEB RESOURCES; REFERENCES; 2 CLEANING, INTEGRATING, AND WAREHOUSING GENOMIC DATA FROM BIOMEDICAL RESOURCES; 2.1 INTRODUCTION; 2.2 RELATED WORK
2.3 TYPOLOGY OF DATA QUALITY PROBLEMS IN BIOMEDICAL RESOURCES 2.4 CLEANING, INTEGRATING, AND WAREHOUSING BIOMEDICAL DATA; 2.4.1 Lessons Learned from Integrating and Warehousing Biomedical Data on Liver Genes and Diseases; 2.4.2 Data Quality-Aware Solutions; 2.4.3 Biological Entity Resolution and Record Linkage; 2.4.4 Ontology-Based Approaches; 2.5 CONCLUSIONS AND PERSPECTIVES; WEB RESOURCES; REFERENCES; 3 CLEANSING OF MASS SPECTROMETRY DATA FOR PROTEIN IDENTIFICATION AND QUANTIFICATION; 3.1 INTRODUCTION; 3.2 PREPROCESSING APPROACH FOR IMPROVING PROTEIN IDENTIFICATION; 3.2.1 Existing Approaches
3.2.2 New Dynamic Wavelet-Based Spectra Preprocessing Method 3.3 IDENTIFICATION FILTERING APPROACH FOR IMPROVING PROTEIN IDENTIFICATION; 3.3.1 Existing Approaches; 3.3.2 New Target-Decoy Approach for Improving Protein Identification; 3.4 EVALUATION RESULTS; 3.4.1 Evaluation of New Proprocessing Method; 3.4.2 Evaluation of New Identification Filtering Method; 3.5 CONCLUSION; REFERENCES; 4 FILTERING PROTEIN-PROTEIN INTERACTIONS BY INTEGRATION OF ONTOLOGY DATA; 4.1 INTRODUCTION; 4.2 EVALUATION OF SEMANTIC SIMILARITY; 4.2.1 Gene Ontology; 4.2.2 Survey of Semantic Similarity Measures
4.2.3 Correlation with Functional Categorizations 4.3 IDENTIFICATION OF FALSE PROTEIN-PROTEIN INTERACTION DATA; 4.3.1 Classification Method; 4.3.2 Accuracy of PPI Classification; 4.3.3 Reliability of PPI Data; 4.4 CONCLUSION; REFERENCES; PART B: BIOLOGICAL DATA MODELING; 5 COMPLEXITY AND SYMMETRIES IN DNA SEQUENCES; 5.1 INTRODUCTION; 5.2 ARCHAEA; 5.3 PATTERNS ON INDICATOR MATRIX; 5.3.1 Indicator Matrix; 5.3.2 Test Sequences; 5.4 MEASURE OF COMPLEXITY AND INFORMATION; 5.4.1 Complexity; 5.4.2 Fractal Dimension; 5.4.3 Entropy; 5.5 COMPLEX ROOT REPRESENTATION OF DNA WORDS
5.5.1 Pseudorandom Sequence on Unit Circle
Record Nr. UNINA-9910821103803321
Elloumi Mourad  
Hoboken, New Jersey : , : Wiley, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Database and Expert Systems Applications : DEXA 2019 International Workshops BIOKDD, IWCFS, MLKgraphs and TIR, Linz, Austria, August 26–29, 2019, Proceedings / / edited by Gabriele Anderst-Kotsis, A Min Tjoa, Ismail Khalil, Mourad Elloumi, Atif Mashkoor, Johannes Sametinger, Xabier Larrucea, Anna Fensel, Jorge Martinez-Gil, Bernhard Moser, Christin Seifert, Benno Stein, Michael Granitzer
Database and Expert Systems Applications : DEXA 2019 International Workshops BIOKDD, IWCFS, MLKgraphs and TIR, Linz, Austria, August 26–29, 2019, Proceedings / / edited by Gabriele Anderst-Kotsis, A Min Tjoa, Ismail Khalil, Mourad Elloumi, Atif Mashkoor, Johannes Sametinger, Xabier Larrucea, Anna Fensel, Jorge Martinez-Gil, Bernhard Moser, Christin Seifert, Benno Stein, Michael Granitzer
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XV, 222 p. 59 illus., 30 illus. in color.)
Disciplina 005.74
Collana Communications in Computer and Information Science
Soggetto topico Database management
Data mining
Information storage and retrieval
Machine learning
Computer security
Optical data processing
Database Management
Data Mining and Knowledge Discovery
Information Storage and Retrieval
Machine Learning
Systems and Data Security
Image Processing and Computer Vision
ISBN 3-030-27684-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910349287003321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Database and Expert Systems Applications : DEXA 2018 International Workshops, BDMICS, BIOKDD, and TIR, Regensburg, Germany, September 3–6, 2018, Proceedings / / edited by Mourad Elloumi, Michael Granitzer, Abdelkader Hameurlain, Christin Seifert, Benno Stein, A Min Tjoa, Roland Wagner
Database and Expert Systems Applications : DEXA 2018 International Workshops, BDMICS, BIOKDD, and TIR, Regensburg, Germany, September 3–6, 2018, Proceedings / / edited by Mourad Elloumi, Michael Granitzer, Abdelkader Hameurlain, Christin Seifert, Benno Stein, A Min Tjoa, Roland Wagner
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (IX, 316 p. 81 illus.)
Disciplina 006.312
Collana Communications in Computer and Information Science
Soggetto topico Database management
Information storage and retrieval
Data mining
Application software
Bioinformatics
Computational biology
Database Management
Information Storage and Retrieval
Data Mining and Knowledge Discovery
Information Systems Applications (incl. Internet)
Computer Appl. in Life Sciences
ISBN 3-319-99133-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto BDMICS 2918 -- Parallel data management systems, consistency and privacy -- Cloud computing and graph queries -- BIOKDD 2018 -- TIR 2018 -- Web and domain corpora -- NLP applications -- Social media and personalization.
Record Nr. UNINA-9910299305603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Deep learning for biomedical data analysis : techniques, approaches, and applications / / Mourad Elloumi, editor
Deep learning for biomedical data analysis : techniques, approaches, and applications / / Mourad Elloumi, editor
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (358 pages)
Disciplina 610.285
Soggetto topico Artificial intelligence - Medical applications
ISBN 3-030-71676-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910492141203321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Pattern recognition in computational molecular biology : techniques and approaches / / edited by Mourad Elloumi [and three others] ; contributors, Andrej Aderhold [and eighty others]
Pattern recognition in computational molecular biology : techniques and approaches / / edited by Mourad Elloumi [and three others] ; contributors, Andrej Aderhold [and eighty others]
Pubbl/distr/stampa Hoboken, New Jersey : , : Wiley, , 2016
Descrizione fisica 1 online resource (720 p.)
Disciplina 572.8
Collana Wiley Series in Bioinformatics: Computational Techniques and Engineering
Soggetto topico Molecular biology - Data processing
Computational biology
Pattern recognition systems
ISBN 1-119-07886-5
1-119-07885-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Wiley Series; Title Page; Copyright; Table of Contents; List of Contributors; Preface; Part 1: Pattern Recognition in Sequences; Chapter 1: Combinatorial Haplotyping Problems; 1.1 Introduction; 1.2 Single Individual Haplotyping; 1.3 Population Haplotyping; References; Chapter 2: Algorithmic Perspectives of the String Barcoding Problems; 2.1 Introduction; 2.2 Summary of Algorithmic Complexity Results for Barcoding Problems; 2.3 Entropy-Based Information Content Technique for Designing Approximation Algorithms for String Barcoding Problems
2.4 Techniques for Proving Inapproximability Results for String Barcoding Problems2.5 Heuristic Algorithms for String Barcoding Problems; 2.6 Conclusion; Acknowledgments; References; Chapter 3: Alignment-Free Measures for Whole-Genome Comparison; 3.1 Introduction; 3.2 Whole-Genome Sequence Analysis; 3.3 Underlying Approach; 3.4 Experimental Results; 3.5 Conclusion; Author's Contributions; 3.6 Acknowledgments; References; Chapter 4: A Maximum Likelihood Framework for Multiple Sequence Local Alignment; 4.1 Introduction; 4.2 Multiple Sequence Local Alignment; 4.3 Motif Finding Algorithms
4.4 Time Complexity4.5 Case Studies; 4.6 Conclusion; References; Chapter 5: Global Sequence Alignment with a Bounded Number of Gaps; 5.1 Introduction; 5.2 Definitions and Notation; 5.3 Problem Definition; 5.4 Algorithms; 5.5 Conclusion; References; Part 2: Pattern Recognition in Secondary Structures; Chapter 6: A Short Review on Protein Secondary Structure Prediction Methods; 6.1 Introduction; 6.2 Representative Protein Secondary Structure Prediction Methods; 6.3 Evaluation of Protein Secondary Structure Prediction Methods; 6.4 Conclusion; Acknowledgments; References
Chapter 7: A Generic Approach to Biological Sequence Segmentation Problems: Application to Protein Secondary Structure Prediction7.1 Introduction; 7.2 Biological Sequence Segmentation; 7.3 MSVMpred; 7.4 Postprocessing with A Generative Model; 7.5 Dedication to Protein Secondary Structure Prediction; 7.6 Conclusions and Ongoing Research; Acknowledgments; References; Chapter 8: Structural Motif Identification and Retrieval: A Geometrical Approach; 8.1 Introduction; 8.2 A Few Basic Concepts; 8.3 State of The Art; 8.4 A Novel Geometrical Approach to Motif Retrieval; 8.5 Implementation Notes
8.6 Conclusions and Future WorkAcknowledgment; References; Chapter 9: Genome-Wide Search for Pseudoknotted Noncoding RNA: A Comparative Study; 9.1 Introduction; 9.2 Background; 9.3 Methodology; 9.4 Results and Interpretation; 9.5 Conclusion; References; Part 3: Pattern Recognition in Tertiary Structures; Chapter 10: Motif Discovery in Protein 3D-Structures using Graph Mining Techniques; 10.1 Introduction; 10.2 From Protein 3D-Structures to Protein Graphs; 10.3 Graph Mining; 10.4 Subgraph Mining; 10.5 Frequent Subgraph Discovery; 10.6 Feature Selection; 10.7 Feature Selection for Subgraphs
10.8 Discussion
Record Nr. UNINA-9910137171903321
Hoboken, New Jersey : , : Wiley, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Pattern recognition in computational molecular biology : techniques and approaches / / edited by Mourad Elloumi [and three others] ; contributors, Andrej Aderhold [and eighty others]
Pattern recognition in computational molecular biology : techniques and approaches / / edited by Mourad Elloumi [and three others] ; contributors, Andrej Aderhold [and eighty others]
Pubbl/distr/stampa Hoboken, New Jersey : , : Wiley, , 2016
Descrizione fisica 1 online resource (720 p.)
Disciplina 572.8
Collana Wiley Series in Bioinformatics: Computational Techniques and Engineering
Soggetto topico Molecular biology - Data processing
Computational biology
Pattern recognition systems
ISBN 1-119-07886-5
1-119-07885-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Wiley Series; Title Page; Copyright; Table of Contents; List of Contributors; Preface; Part 1: Pattern Recognition in Sequences; Chapter 1: Combinatorial Haplotyping Problems; 1.1 Introduction; 1.2 Single Individual Haplotyping; 1.3 Population Haplotyping; References; Chapter 2: Algorithmic Perspectives of the String Barcoding Problems; 2.1 Introduction; 2.2 Summary of Algorithmic Complexity Results for Barcoding Problems; 2.3 Entropy-Based Information Content Technique for Designing Approximation Algorithms for String Barcoding Problems
2.4 Techniques for Proving Inapproximability Results for String Barcoding Problems2.5 Heuristic Algorithms for String Barcoding Problems; 2.6 Conclusion; Acknowledgments; References; Chapter 3: Alignment-Free Measures for Whole-Genome Comparison; 3.1 Introduction; 3.2 Whole-Genome Sequence Analysis; 3.3 Underlying Approach; 3.4 Experimental Results; 3.5 Conclusion; Author's Contributions; 3.6 Acknowledgments; References; Chapter 4: A Maximum Likelihood Framework for Multiple Sequence Local Alignment; 4.1 Introduction; 4.2 Multiple Sequence Local Alignment; 4.3 Motif Finding Algorithms
4.4 Time Complexity4.5 Case Studies; 4.6 Conclusion; References; Chapter 5: Global Sequence Alignment with a Bounded Number of Gaps; 5.1 Introduction; 5.2 Definitions and Notation; 5.3 Problem Definition; 5.4 Algorithms; 5.5 Conclusion; References; Part 2: Pattern Recognition in Secondary Structures; Chapter 6: A Short Review on Protein Secondary Structure Prediction Methods; 6.1 Introduction; 6.2 Representative Protein Secondary Structure Prediction Methods; 6.3 Evaluation of Protein Secondary Structure Prediction Methods; 6.4 Conclusion; Acknowledgments; References
Chapter 7: A Generic Approach to Biological Sequence Segmentation Problems: Application to Protein Secondary Structure Prediction7.1 Introduction; 7.2 Biological Sequence Segmentation; 7.3 MSVMpred; 7.4 Postprocessing with A Generative Model; 7.5 Dedication to Protein Secondary Structure Prediction; 7.6 Conclusions and Ongoing Research; Acknowledgments; References; Chapter 8: Structural Motif Identification and Retrieval: A Geometrical Approach; 8.1 Introduction; 8.2 A Few Basic Concepts; 8.3 State of The Art; 8.4 A Novel Geometrical Approach to Motif Retrieval; 8.5 Implementation Notes
8.6 Conclusions and Future WorkAcknowledgment; References; Chapter 9: Genome-Wide Search for Pseudoknotted Noncoding RNA: A Comparative Study; 9.1 Introduction; 9.2 Background; 9.3 Methodology; 9.4 Results and Interpretation; 9.5 Conclusion; References; Part 3: Pattern Recognition in Tertiary Structures; Chapter 10: Motif Discovery in Protein 3D-Structures using Graph Mining Techniques; 10.1 Introduction; 10.2 From Protein 3D-Structures to Protein Graphs; 10.3 Graph Mining; 10.4 Subgraph Mining; 10.5 Frequent Subgraph Discovery; 10.6 Feature Selection; 10.7 Feature Selection for Subgraphs
10.8 Discussion
Record Nr. UNINA-9910819436003321
Hoboken, New Jersey : , : Wiley, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui