000800015 000__ 04825cam\a2200505Ii\4500
000800015 001__ 800015
000800015 005__ 20230306143656.0
000800015 006__ m\\\\\o\\d\\\\\\\\
000800015 007__ cr\un\nnnunnun
000800015 008__ 170922s2017\\\\sz\\\\\\ob\\\\000\0\eng\d
000800015 019__ $$a1004423959$$a1004733728
000800015 020__ $$a9783319598260$$q(electronic book)
000800015 020__ $$a3319598260$$q(electronic book)
000800015 020__ $$z9783319598246
000800015 020__ $$z3319598244
000800015 035__ $$aSP(OCoLC)on1004597943
000800015 035__ $$aSP(OCoLC)1004597943$$z(OCoLC)1004423959$$z(OCoLC)1004733728
000800015 040__ $$aYDX$$beng$$erda$$cYDX$$dN$T$$dEBLCP$$dGW5XE$$dN$T
000800015 049__ $$aISEA
000800015 050_4 $$aQP625.N89
000800015 08204 $$a572.8/633$$223
000800015 24500 $$aAlgorithms for next-generation sequencing data :$$btechniques, approaches, and applications /$$cMourad Elloumi, editor.
000800015 264_1 $$aCham :$$bSpringer,$$c[2017]
000800015 264_4 $$c©2017
000800015 300__ $$a1 online resource.
000800015 336__ $$atext$$btxt$$2rdacontent
000800015 337__ $$acomputer$$bc$$2rdamedia
000800015 338__ $$aonline resource$$bcr$$2rdacarrier
000800015 504__ $$aIncludes bibliographical references.
000800015 5050_ $$aPreface; Contents; Contributors; Part I Indexing, Compression, and Storage of NGS Data; 1 Algorithms for Indexing Highly Similar DNA Sequences; 1.1 Introduction; 1.2 Basic Concepts; 1.3 Basic Data Structures; 1.3.1 Trie; 1.3.1.1 Structure Construction; 1.3.1.2 Search for a Pattern P of Length m; 1.3.2 Suffix Tree; 1.3.2.1 Structure Construction; 1.3.2.2 Search for a Pattern P of Length m; 1.3.3 DAWG; 1.3.3.1 Structure Construction; 1.3.3.2 Search for a Pattern P of Length m; 1.3.4 Suffix Array; 1.3.4.1 Structure Construction; 1.3.4.2 Search for a Pattern P of Length m
000800015 5058_ $$a1.4 Advanced Data Structures1.4.1 FM Index; 1.4.1.1 Burrows-Wheeler Transform; 1.4.1.2 Backward Search; 1.4.2 Compressed Suffix Array ; 1.4.2.1 Grossi-CSA; 1.4.2.2 Sadakane-CSA; 1.4.2.3 Grossi-Gupta-CSA; 1.4.3 Lempel-Ziv Indexes; 1.4.3.1 LZ78 Algorithm; 1.4.3.2 LZ Index; 1.5 More Advanced Data Structures; 1.5.1 Common and Differentiating Segments; 1.5.1.1 Model 1; 1.5.1.2 Model 2; 1.5.1.3 A Second Solution; 1.5.2 Fast Relative Lempel-Ziv Self-index; 1.5.3 BIO-FMI Index; 1.5.3.1 Description; 1.5.4 Suffix Tree of an Alignment; 1.5.4.1 Structure Construction
000800015 5058_ $$a1.5.4.2 Search for a Pattern P of Length m1.5.5 Suffix Array of an Alignment; 1.5.5.1 Structure Construction; 1.5.5.2 Search for a Pattern P of Length m; 1.6 Conclusion; References; 2 Full-Text Indexes for High-Throughput Sequencing; 2.1 Introduction; 2.1.1 Notations; 2.1.2 Padding; 2.2 Background; 2.2.1 Suffix Trie; 2.2.2 Suffix Tree; 2.2.3 Suffix Array; 2.2.4 Burrows-Wheeler Transform; 2.2.4.1 Inversion; 2.3 Suffix Trie Realizations; 2.3.1 Suffix Array; 2.3.2 FM-Index; 2.3.2.1 Rank Dictionaries; 2.3.2.2 Top-Down Traversal; 2.3.2.3 Sparse Suffix Array; 2.4 Suffix Tree Realizations
000800015 5058_ $$a2.4.1 Enhanced Suffix Array2.4.1.1 LCP Table; 2.4.1.2 Child Table; 2.4.1.3 Top-Down Traversal; 2.4.2 Lazy Suffix Tree; 2.4.2.1 The WOTD Algorithm; 2.4.2.2 The Data Structure; 2.4.2.3 Node Expansion; 2.4.2.4 Generalization to Multiple Sequences; 2.5 q-Gram Index Realizations; 2.5.1 Direct Addressing; 2.5.2 Open Addressing; 2.6 Applications; 2.6.1 Depth-First Traversal; 2.6.2 Exact String matching; 2.6.3 Approximate String Matching; 2.7 Conclusion; References; 3 Searching and Indexing Circular Patterns; 3.1 Introduction; 3.2 Circular Dictionary Matching
000800015 5058_ $$a3.2.1 Properties of the Partitioning Technique3.2.2 Circular String Matching via Filtering; 3.2.2.1 Longest Common Extension; 3.2.2.2 Algorithm CSMF; 3.2.2.3 Algorithm CSMF-Simple; 3.2.3 Circular Dictionary Matching via Filtering; 3.2.4 Key Results; 3.3 Circular Pattern Indexing; 3.3.1 The CPI-II Data Structure; 3.3.2 A Folklore Indexing Data Structure; 3.3.3 Key Results; 3.4 Final Remarks and Outlook; References; 4 De Novo NGS Data Compression; 4.1 Introduction; 4.2 Generic Text Compression; 4.2.1 Coding; 4.2.2 Modeling; 4.2.2.1 Basic Modeling; 4.2.2.2 Statistical-Based Approach
000800015 506__ $$aAccess limited to authorized users.
000800015 520__ $$a"The 14 contributed chapters in this book survey the most recent developments in high-performance algorithms for NGS data, offering fundamental insights and technical information specifically on indexing, compression and storage; error correction; alignment; and assembly."--$$cProvided by publisher.
000800015 588__ $$aDescription based on print version record.
000800015 650_0 $$aNucleotide sequence$$xData processing.
000800015 650_0 $$aComputer algorithms.
000800015 7001_ $$aElloumi, Mourad,$$eeditor.
000800015 77608 $$iPrint version:$$z9783319598246$$z3319598244$$w(OCoLC)985080269
000800015 852__ $$bebk
000800015 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-59826-0$$zOnline Access$$91397441.1
000800015 909CO $$ooai:library.usi.edu:800015$$pGLOBAL_SET
000800015 980__ $$aEBOOK
000800015 980__ $$aBIB
000800015 982__ $$aEbook
000800015 983__ $$aOnline
000800015 994__ $$a92$$bISE