@inproceedings{CDDMj05,
 abstract = {Inspired by the combinatorial denoising method DUDE, we present efficient algorithms for
implementing this idea for arbitrary contexts or for using it within subsequences. We also propose
effective, efficient denoising error estimators so we can find the best denoising of an input sequence
over different context lengths. Our methods are simple, drawing from string matching methods and
radix sorting. We also present experimental results of our proposed algorithms.},
 author = {S. Chen and S N. Diggavi and S. Dusad and S. Muthukrishnan},
 booktitle = {IEEE   Data Compression Conference (DCC), Snowbird, Utah},
 file = {:papers:strmtch.pdf},
 label = {cddm_c05},
 month = {March},
 note = {},
 pages = {153--162},
 tags = {conf,CSalgo,Denoising,SP,SelConf},
 title = {Efficient String Matching Algorithms for Combinatorial Universal Denoising},
 type = {4},
 year = {2005}
}

{"_id":"BKvzsbZ6QmEp3ieBL","bibbaseid":"chen-diggavi-dusad-muthukrishnan-efficientstringmatchingalgorithmsforcombinatorialuniversaldenoising-2005","author_short":["Chen, S.","Diggavi, S N.","Dusad, S.","Muthukrishnan, S."],"bibdata":{"bibtype":"inproceedings","type":"4","abstract":"Inspired by the combinatorial denoising method DUDE, we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators so we can find the best denoising of an input sequence over different context lengths. Our methods are simple, drawing from string matching methods and radix sorting. We also present experimental results of our proposed algorithms.","author":[{"firstnames":["S."],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Dusad"],"suffixes":[]},{"firstnames":["S."],"propositions":[],"lastnames":["Muthukrishnan"],"suffixes":[]}],"booktitle":"IEEE Data Compression Conference (DCC), Snowbird, Utah","file":":papers:strmtch.pdf","label":"cddm_c05","month":"March","note":"","pages":"153–162","tags":"conf,CSalgo,Denoising,SP,SelConf","title":"Efficient String Matching Algorithms for Combinatorial Universal Denoising","year":"2005","bibtex":"@inproceedings{CDDMj05,\n abstract = {Inspired by the combinatorial denoising method DUDE, we present efficient algorithms for\nimplementing this idea for arbitrary contexts or for using it within subsequences. We also propose\neffective, efficient denoising error estimators so we can find the best denoising of an input sequence\nover different context lengths. Our methods are simple, drawing from string matching methods and\nradix sorting. We also present experimental results of our proposed algorithms.},\n author = {S. Chen and S N. Diggavi and S. Dusad and S. Muthukrishnan},\n booktitle = {IEEE Data Compression Conference (DCC), Snowbird, Utah},\n file = {:papers:strmtch.pdf},\n label = {cddm_c05},\n month = {March},\n note = {},\n pages = {153--162},\n tags = {conf,CSalgo,Denoising,SP,SelConf},\n title = {Efficient String Matching Algorithms for Combinatorial Universal Denoising},\n type = {4},\n year = {2005}\n}\n\n","author_short":["Chen, S.","Diggavi, S N.","Dusad, S.","Muthukrishnan, S."],"key":"CDDMj05","id":"CDDMj05","bibbaseid":"chen-diggavi-dusad-muthukrishnan-efficientstringmatchingalgorithmsforcombinatorialuniversaldenoising-2005","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["efficient","string","matching","algorithms","combinatorial","universal","denoising","chen","diggavi","dusad","muthukrishnan"],"title":"Efficient String Matching Algorithms for Combinatorial Universal Denoising","year":2005}