{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:06:19Z","timestamp":1730300779803,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/tencon.2018.8650369","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:10:38Z","timestamp":1552929038000},"page":"0811-0814","source":"Crossref","is-referenced-by-count":0,"title":["RISC-Based Simulation of Longest Common Subsequence Algorithm in MIPS64 Simulators"],"prefix":"10.1109","author":[{"given":"Glenn Paul P.","family":"Gara","sequence":"first","affiliation":[]},{"given":"Mark Phil B.","family":"Pacot","sequence":"additional","affiliation":[]},{"given":"Roger Luis T.","family":"Uy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/978-3-540-73499-4_44","article-title":"Efficient subsequence matching using the longest common subsequence with a dual match index","author":"han","year":"2007","journal-title":"Proceedings Workshop on Machine Learning and Data Mining in Pattern Recognition"},{"key":"ref11","first-page":"17","article-title":"A recom-mender system approach for classifying user navigation patterns using longest common subsequence algorithm","volume":"4","author":"jalali","year":"2009","journal-title":"American Journal of Scientific Research"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-2-10"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/spe.976"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003674"},{"key":"ref15","article-title":"Revision 3.2, MIPS Technologies","author":"mips iv","year":"1995","journal-title":"Inc entire publication submitted (Sep 1995)"},{"journal-title":"EduMIPS64 Documentation","year":"2017","author":"spadaccini","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2017.7880452"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264437"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LISAT.2013.6578243"},{"journal-title":"Guide to RISC Processors For Programmers and Engineers","year":"2005","author":"dandamudi","key":"ref5"},{"key":"ref8","first-page":"499","article-title":"An efficient parallel algorithm for longest common subsequence problem on GPUs","volume":"1","author":"yang","year":"2010","journal-title":"Proceedings of the World Congress on Engineering"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/HNICEM.2017.8269447"},{"key":"ref2","first-page":"5781","article-title":"On the longest common subsequence problem","volume":"6","author":"gorbenko","year":"2012","journal-title":"Applied Mathematical Sciences"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1031120.1031122"},{"key":"ref9","article-title":"Parallel computing the Longest Common Subsequence (LCS) on GPUs: efficiency and language suitability","author":"dhraief","year":"2011","journal-title":"The 1st International Conference on Advanced Communications and Computation (INFOCOMP)"}],"event":{"name":"TENCON 2018 - 2018 IEEE Region 10 Conference","start":{"date-parts":[[2018,10,28]]},"location":"Jeju, Korea (South)","end":{"date-parts":[[2018,10,31]]}},"container-title":["TENCON 2018 - 2018 IEEE Region 10 Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8643125\/8650051\/08650369.pdf?arnumber=8650369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:35:19Z","timestamp":1598222119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8650369\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/tencon.2018.8650369","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}