{"id":"https://openalex.org/W2919344332","doi":"https://doi.org/10.1109/tencon.2018.8650369","title":"RISC-Based Simulation of Longest Common Subsequence Algorithm in MIPS64 Simulators","display_name":"RISC-Based Simulation of Longest Common Subsequence Algorithm in MIPS64 Simulators","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2919344332","doi":"https://doi.org/10.1109/tencon.2018.8650369","mag":"2919344332"},"language":"en","primary_location":{"id":"doi:10.1109/tencon.2018.8650369","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon.2018.8650369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2018 - 2018 IEEE Region 10 Conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028251617","display_name":"Glenn Paul P. Gara","orcid":null},"institutions":[{"id":"https://openalex.org/I260054107","display_name":"University of the Immaculate Conception","ror":"https://ror.org/0204b4294","country_code":"PH","type":"education","lineage":["https://openalex.org/I260054107"]}],"countries":["PH"],"is_corresponding":true,"raw_author_name":"Glenn Paul P. Gara","raw_affiliation_strings":["Information Technology Education Program, University of the Immaculate Conception, Davao City, Philippines"],"affiliations":[{"raw_affiliation_string":"Information Technology Education Program, University of the Immaculate Conception, Davao City, Philippines","institution_ids":["https://openalex.org/I260054107"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024726538","display_name":"Mark Phil B. Pacot","orcid":"https://orcid.org/0000-0003-2548-4059"},"institutions":[{"id":"https://openalex.org/I210563421","display_name":"Caraga State University","ror":"https://ror.org/00erb5q72","country_code":"PH","type":"education","lineage":["https://openalex.org/I210563421"]}],"countries":["PH"],"is_corresponding":false,"raw_author_name":"Mark Phil B. Pacot","raw_affiliation_strings":["College of Engineering and Information Technology, Caraga State University, Butuan City, Philippines"],"affiliations":[{"raw_affiliation_string":"College of Engineering and Information Technology, Caraga State University, Butuan City, Philippines","institution_ids":["https://openalex.org/I210563421"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017171314","display_name":"Roger Luis Uy","orcid":null},"institutions":[{"id":"https://openalex.org/I5996616","display_name":"De La Salle University","ror":"https://ror.org/04xftk194","country_code":"PH","type":"education","lineage":["https://openalex.org/I5996616"]}],"countries":["PH"],"is_corresponding":false,"raw_author_name":"Roger Luis T. Uy","raw_affiliation_strings":["College of Computer Studies, De La Salle University, Manila, Philippines"],"affiliations":[{"raw_affiliation_string":"College of Computer Studies, De La Salle University, Manila, Philippines","institution_ids":["https://openalex.org/I5996616"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028251617"],"corresponding_institution_ids":["https://openalex.org/I260054107"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18714862,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":null,"first_page":"0811","last_page":"0814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12946","display_name":"Fractal and DNA sequence analysis","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9024734497070312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7436146140098572},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6696680188179016},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6291266679763794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6019814014434814},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5920464396476746},{"id":"https://openalex.org/keywords/reduced-instruction-set-computing","display_name":"Reduced instruction set computing","score":0.5548146367073059},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.4929225444793701},{"id":"https://openalex.org/keywords/instruction-set","display_name":"Instruction set","score":0.4092445373535156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12739965319633484}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9024734497070312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7436146140098572},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6696680188179016},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6291266679763794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6019814014434814},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5920464396476746},{"id":"https://openalex.org/C126298526","wikidata":"https://www.wikidata.org/wiki/Q189376","display_name":"Reduced instruction set computing","level":3,"score":0.5548146367073059},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4929225444793701},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.4092445373535156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12739965319633484},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tencon.2018.8650369","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon.2018.8650369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2018 - 2018 IEEE Region 10 Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1505025260","https://openalex.org/W1559327029","https://openalex.org/W1970026646","https://openalex.org/W1975975525","https://openalex.org/W1988792627","https://openalex.org/W2041650430","https://openalex.org/W2068374154","https://openalex.org/W2088055539","https://openalex.org/W2110372165","https://openalex.org/W2155303474","https://openalex.org/W2265509363","https://openalex.org/W2525058782","https://openalex.org/W2560137734","https://openalex.org/W2601104595","https://openalex.org/W2786213331","https://openalex.org/W4243733003","https://openalex.org/W6629991989","https://openalex.org/W6693354629","https://openalex.org/W6727810314","https://openalex.org/W6730551790"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":{"The":[0,55,75],"longest":[1,24],"common":[2],"subsequence":[3],"(LCS)":[4],"is":[5],"an":[6],"essential":[7],"technique":[8],"in":[9,26,62],"the":[10,23,35,38,44,47,60,66,78,86,89,94,101,106,109,117],"sequence":[11],"alignment.":[12],"By":[13],"deleting":[14],"zero":[15],"or":[16],"more":[17],"symbols,":[18],"it":[19],"determines":[20],"one":[21],"of":[22,34,51,88,96,112],"subsequences":[25],"a":[27,32,81],"sequence.":[28],"This":[29],"paper":[30],"described":[31],"simulation":[33],"algorithm":[36],"using":[37],"EduMIPS64":[39,118],"and":[40,73,84],"MIPSers":[41,107],"simulators":[42],"where":[43],"latter":[45],"implements":[46],"most":[48],"recent":[49],"developments":[50],"MIPS64":[52],"instruction":[53],"sets.":[54],"method":[56],"applied":[57],"to":[58,116],"solve":[59],"LCS":[61,79],"this":[63],"study":[64],"was":[65],"first":[67],"known":[68],"solution":[69],"invented":[70],"by":[71,92],"Wagner":[72],"Fischer.":[74],"authors":[76],"programmed":[77],"on":[80],"RISC":[82],"architecture":[83],"evaluated":[85],"results":[87],"test":[90],"cases":[91],"observing":[93],"number":[95,111],"clock":[97,113],"cycles":[98,114],"performed":[99],"through":[100],"simulators.":[102],"Results":[103],"show":[104],"that":[105],"executed":[108],"least":[110],"compared":[115],"simulator.":[119]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}