{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:12:28Z","timestamp":1648944748644},"reference-count":21,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.151.9","type":"journal-article","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T01:31:46Z","timestamp":1400635906000},"page":"139-150","source":"Crossref","is-referenced-by-count":0,"title":["Languages of lossless seeds"],"prefix":"10.4204","volume":"151","author":[{"given":"Karel","family":"B\u0159inda","sequence":"first","affiliation":[{"name":"LIGM Universit\u00e9 Paris-Est Marne-la-Vall\u00e9e"}]}],"member":"2720","published-online":{"date-parts":[[2014,5,21]]},"reference":[{"key":"diplomka","volume-title":"Lossless seeds for approximate string matching","author":"B\u0159inda","year":"2013"},{"key":"qgrampre","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-48194-X_6","article-title":"Better Filtering with Gapped q-Grams","volume-title":"Proceedings of the 12th Symposium on Combinatorial Pattern Matching (CPM)","volume":"2089","author":"Burkhardt","year":"2001"},{"key":"qgram","first-page":"51","article-title":"Better filtering with gapped q-grams","volume":"56","author":"Burkhardt","year":"2002","journal-title":"Fundamenta Informaticae"},{"issue":"19","key":"perm","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1093\/bioinformatics\/btp486","article-title":"PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds","volume":"25","author":"Chen","year":"2009","journal-title":"Bioinformatics"},{"key":"perfect_rulers","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-24583-1_5","article-title":"Spaced Seeds Design Using Perfect Rulers","volume-title":"Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE), Pisa (Italy)","volume":"7024","author":"Egidi","year":"2011"},{"issue":"7","key":"quadratic_residues","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1016\/j.jcss.2013.03.002","article-title":"Better spaced seeds using quadratic residues","volume":"79","author":"Egidi","year":"2013","journal-title":"Journal of Computer and System Sciences"},{"key":"periodic_seeds","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2013.12.007","article-title":"Design and analysis of periodic multiple seeds","volume":"522","author":"Egidi","year":"2014","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"perfect_rulers2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3233\/FI-2014-1009","article-title":"Spaced Seeds Design Using Perfect Rulers","volume":"131","author":"Egidi","year":"2014","journal-title":"Fundamenta Informaticae"},{"issue":"7","key":"optimal_seeds_asymptotic","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1016\/j.jcss.2007.03.007","article-title":"Optimal spaced seeds for faster approximate string matching","volume":"73","author":"Farach-Colton","year":"2007","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"multiseed","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/tcbb.2005.12","article-title":"Multiseed lossless filtration","volume":"2","author":"Kucherov","year":"2005","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"issue":"5","key":"Li2010a","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1093\/bib\/bbq015","article-title":"A survey of sequence alignment algorithms for next-generation sequencing.","volume":"11","author":"Li","year":"2010","journal-title":"Briefings in bioinformatics"},{"issue":"21","key":"zoom","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.1093\/bioinformatics\/btn416","article-title":"ZOOM! Zillions Of Oligos Mapped","volume":"24","author":"Lin","year":"2008","journal-title":"Bioinformatics"},{"key":"Lind1995","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"Lind","year":"1995"},{"key":"Lothaire1997","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","volume":"17","author":"Lothaire","year":"1983"},{"issue":"3","key":"patternhunter","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","article-title":"PatternHunter: Faster and more sensitive homology search","volume":"18","author":"Ma","year":"2002","journal-title":"Bioinformatics"},{"issue":"3","key":"needleman-wunsch","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"Journal of Molecular Biology"},{"key":"hardnesspre","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/b137128","article-title":"Hardness of Optimal Spaced Seed Design","volume-title":"Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), Jeju Island (Korea)","volume":"3537","author":"Nicolas","year":"2005"},{"issue":"5","key":"hardness","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.jcss.2007.10.001","article-title":"Hardness of Optimal Spaced Seed Design","volume":"74","author":"Nicolas","year":"2008","journal-title":"Journal of Computer and System Sciences"},{"key":"yass","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gki478","article-title":"YASS: enhancing the sensitivity of DNA similarity search","volume":"33","author":"No\u00e9","year":"2005","journal-title":"Nucleic Acids Research"},{"key":"Ribeca2012","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-1-4614-0782-9_7","article-title":"Short-Read Mapping","volume-title":"Bioinformatics for High Throughput Sequencing","author":"Ribeca","year":"2012"},{"issue":"1","key":"smith-watermann","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences.","volume":"147","author":"Smith","year":"1981","journal-title":"Journal of molecular biology"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T05:51:58Z","timestamp":1400824318000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1403.6414v3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,21]]},"references-count":21,"URL":"https:\/\/doi.org\/10.4204\/eptcs.151.9","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,21]]}}}