{"title":"加速hirschberg和hunt-szymanski LCS算法","authors":"M. Crochemore, C. Iliopoulos, Y. Pinzón","doi":"10.1109/SPIRE.2001.989737","DOIUrl":null,"url":null,"abstract":"Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg's divide-and- conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an ef£cient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very ef£ciently in practice.","PeriodicalId":107511,"journal":{"name":"Proceedings Eighth Symposium on String Processing and Information Retrieval","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Speeding-up hirschberg and hunt-szymanski LCS algorithms\",\"authors\":\"M. Crochemore, C. Iliopoulos, Y. Pinzón\",\"doi\":\"10.1109/SPIRE.2001.989737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg's divide-and- conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an ef£cient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very ef£ciently in practice.\",\"PeriodicalId\":107511,\"journal\":{\"name\":\"Proceedings Eighth Symposium on String Processing and Information Retrieval\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth Symposium on String Processing and Information Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPIRE.2001.989737\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth Symposium on String Processing and Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIRE.2001.989737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Speeding-up hirschberg and hunt-szymanski LCS algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg's divide-and- conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an ef£cient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very ef£ciently in practice.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
