A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis
{"title":"推理算法中动态块与静态块的比较","authors":"A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis","doi":"10.9790/0661-1904013943","DOIUrl":null,"url":null,"abstract":"In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comparison Between Dynamic And Static Blocks In Sequitur Algorithm\",\"authors\":\"A. Siahaan, S. Aryza, R. Rahim, Andre Hasudungan Lubis\",\"doi\":\"10.9790/0661-1904013943\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.\",\"PeriodicalId\":91890,\"journal\":{\"name\":\"IOSR journal of computer engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IOSR journal of computer engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9790/0661-1904013943\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/0661-1904013943","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparison Between Dynamic And Static Blocks In Sequitur Algorithm
In the Sequitur algorithm, the compression process is performed based on the number of characters having similar similarities. Similarities will be detected on every syllable in the entire text. Determination of the number of characters to be compared will affect the compression level of this algorithm. Using dynamic or static blocks can optimize the number of compressed characters and of course, it affects the speed of data transmission.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
