Efficient determination of the unique decodability of a string

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 1411-1415

  Filtser, Arnold ^a   Jin, Jiaxi ^b   Kontorovich, Aryeh ^a   Trachtenberg, Ari ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Boston University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ON-LINE ALGORITHMS; SPACE COMPLEXITY; STREAMING ALGORITHM; STRING RECONCILIATION; SUB-STRINGS; TIME COMPLEXITY;

BUILDING MATERIALS; GENETIC ENGINEERING; INFORMATION THEORY;

ALGORITHMS;

EID: 84890355079     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620459     Document Type: Conference Paper

References (19)

1. A. Orlitsky, "Interactive communication: Balanced distributions, correlated files, and average-case complexity." in Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 228-238.
2. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM J. Comp., vol. 38, no. 1, pp. 97-139, 2008.
3. M. Chaisson, P. A. Pevzner, and H. Tang, "Fragment assembly with short reads," Bioinformatics, vol. 20, no. 13, pp. 2067-2074, 2004.
4. X. Shi, H. Xie, S. Zhang, and B. Hao, "Decomposition and reconstruction of protein sequences: The problem of uniqueness and factorizable language." Journal of the Korean Physical Society, vol. 50, no. 1I, pp. 118-123, 2007.
5. P. Pevzner, "DNA physical mapping and alternating Eulerian cycles in colored graphs," Algorithmica, vol. 13, pp. 77-105, 1995.
6. E. Ukkonen, "Approximate string-matching with q-grams and maximal matches," Theoretical Computer Science, vol. 92, no. 1, pp. 191-211, 1992.
7. L. Kontorovich, "Uniquely decodable n-gram embeddings," Theor. Comput. Sci., vol. 329, no. 1-3, pp. 271-284, 2004.
8. Q. Li and H. Xie, "Finite automata for testing composition-based reconstructibility of sequences," J. Comput. Syst. Sci., vol. 74, no. 5, pp. 870-874, 2008.
9. A. L. Kontorovich and A. Trachtenberg, "Unique decodability for string reconciliation," submitted. [Online]. Available: http://arxiv.org/abs/1111.6431
10. G. Cormode, M. Paterson, S. Sahinalp, and U. Vishkin, "Communication complexity of document exchange," in SODA, 2000, pp. 197-206.
11. A. Tridgell, "Efficient algorithms for sorting and synchronization," Ph.D. dissertation, Australian National University, 2000.
12. A. Orlitsky and K. Viswanathan, "Practical protocols for interactive communication," in IEEE International Symposium on Info. Theory, June 2001.
13. T. Suel, P. Noel, and D. Trendafilov, "Improved file synchronization techniques for maintaining large replicated collections over slow networks," in ICDE, 2004, pp. 153-164.
14. Y. Minsky, A. Trachtenberg, and R. Zippel, "Set reconciliation with nearly optimal communication complexity," IEEE Trans. on Info. Theory, September 2003.
15. Y. Minsky and A. Trachtenberg, "Scalable set reconciliation," in Proc. 40-Th Allerton Conference on Comm., Control, and Computing, Monticello, IL., October 2002.
16. S. Agarwal, V. Chauhan, and A. Trachtenberg, "Bandwidth efficient string reconciliation using puzzles," IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 11, pp. 1217-1225, 2006.
17. A. Motahari, G. Bresler, and D. Tse, "Information theory of dna sequencing." [Online]. Available: http://arxiv.org/abs/1203.6233v2
18. A. L. Kontorovich and A. Trachtenberg, "String reconciliation with unknown edit distance," presented in part at ITA 2012. Also submitted elsewhere.
19. M. Dyer, A. Frieze, and S. Suen, "The probability of unique solutions of sequencing by hybridization," Journal of Computational Biology, vol. 1, no. 2, pp. 105-110, Summer 1994.