{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:37:50Z","timestamp":1648687070290},"reference-count":17,"publisher":"International Academy Publishing (IAP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.9.10.2622-2627","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T21:00:48Z","timestamp":1415048448000},"source":"Crossref","is-referenced-by-count":2,"title":["Memory Optimization for Global Protein Network Alignment Using Pushdown Automata and De Bruijn Graph"],"prefix":"10.17706","volume":"9","author":[{"given":"Sarwar","family":"Kamal","sequence":"first","affiliation":[]},{"given":"Mohammad Ibrahim","family":"Khan","sequence":"additional","affiliation":[]}],"member":"7163","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm156"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.291"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.1883"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr216"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16321-0_14"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/ng.1028"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1186\/1471-2105-13-S6-S5","article-title":"KISSPLICE: de-novo calling alternative splicing events from RNA-seq data.","volume":"13","author":"Sacomoto","year":"2012","unstructured":"[8] G.Sacomoto, J.Kielbassa, R.Chikhi, R.Uricaru, P.Antoniou, M.Sagot, P.Peterlongo, V.Lacroix, KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinformatics 2012, 13(Suppl 6):S5. [http:\/\/www.biomedcentral.com\/1471-2105\/13\/S6\/S5]","journal-title":"BMC Bioinformatics","ISSN":"http:\/\/id.crossref.org\/issn\/1471-2105","issn-type":"print"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1101\/gr.097261.109"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1101\/gr.089532.108"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq697"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0019816"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-48"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-S6-S1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"ref16","first-page":"456","article-title":"Less hashing, same performance: Building a better Bloom filter.","volume":"4168","author":"Kirsch","year":"2006","unstructured":"[20] A.Kirsch, M.Mitzenmacher, Less hashing, same performance: Building a better Bloom filter. Algorithms\u2013ESA, 4168:456\u2013467,2006.","journal-title":"Algorithms\u2013ESA"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T11:26:43Z","timestamp":1598441203000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/13603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":17,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2014,10,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.9.10.2622-2627","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}