一种高效的基于MPI-OpenMP的最长公共子序列并行算法

{"title":"一种高效的基于MPI-OpenMP的最长公共子序列并行算法","authors":"A. Yadav, A. Khan, M. Ahmed","doi":"10.1049/icp.2023.1453","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":258131,"journal":{"name":"27th International Conference on Advanced Computing and Communications (ADCOM 2022)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An efficient hybrid MPI-OpenMP based parallel approach for longest common subsequence\",\"authors\":\"A. Yadav, A. Khan, M. Ahmed\",\"doi\":\"10.1049/icp.2023.1453\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":258131,\"journal\":{\"name\":\"27th International Conference on Advanced Computing and Communications (ADCOM 2022)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th International Conference on Advanced Computing and Communications (ADCOM 2022)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1049/icp.2023.1453\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"27th International Conference on Advanced Computing and Communications (ADCOM 2022)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/icp.2023.1453","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}