SCOPUS 정보 검색 플랫폼

Information Processing Letters

Volumn 110, Issue 18-19, 2010, Pages 815-820

A bisection algorithm for grammar-based compression of ordered trees

(1) Akutsu, Tatsuya a

a KYOTO UNIVERSITY (Japan)

Author keywords

Approximation algorithms; Data compression; Graph algorithms; Tree grammars

Indexed keywords

BISECTION ALGORITHMS; BOUNDED DEGREE; GRAMMAR-BASED COMPRESSION; GRAPH ALGORITHMS; ORDERED TREE; POLYNOMIAL-TIME ALGORITHMS; TREE GRAMMARS; UNORDERED TREES;

DATA COMPRESSION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77954412402 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/j.ipl.2010.07.004 Document Type: Article

Times cited : (18)

References (9)

1
- 33747143740
- A relation between edit distance for ordered trees and edit distance for Euler strings
- T. Akutsu A relation between edit distance for ordered trees and edit distance for Euler strings Information Processing Letters 100 2006 105 109
- (2006) Information Processing Letters , vol.100 , pp. 105-109
- Akutsu, T.¹

2
- 43049155961
- Efficient memory representation of XML document trees
- G. Busatto, M. Lohrey, and S. Maneth Efficient memory representation of XML document trees Information Systems 33 2008 456 474
- (2008) Information Systems , vol.33 , pp. 456-474
- Busatto, G.¹ Lohrey, M.² Maneth, S.³

3
- 23844439339
- The smallest grammar problem
- M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat The smallest grammar problem IEEE Transactions on Information Theory 51 2005 2554 2576
- (2005) IEEE Transactions on Information Theory , vol.51 , pp. 2554-2576
- Charikar, M.¹ Lehman, E.² Liu, D.³ Panigrahy, R.⁴ Prabhakaran, M.⁵ Sahai, A.⁶ Shelat, A.⁷

4
- 0345580861
- On an algorithm of Zemlyachenko for subtree isomorphism
- Y. Dinitz, A. Itai, and M. Rodeh On an algorithm of Zemlyachenko for subtree isomorphism Information Processing Letters 70 1999 141 146
- (1999) Information Processing Letters , vol.70 , pp. 141-146
- Dinitz, Y.¹ Itai, A.² Rodeh, M.³

5
- 0034188132
- Grammar-based codes: A new class of universal lossless source codes
- J.C. Kieffer, and E.-H. Yang Grammar-based codes: A new class of universal lossless source codes IEEE Transactions on Information Theory 46 2000 737 754
- (2000) IEEE Transactions on Information Theory , vol.46 , pp. 737-754
- Kieffer, J.C.¹ Yang, E.-H.²

6
- 0038238644
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression
- W. Rytter Application of Lempel-Ziv factorization to the approximation of grammar-based compression Theoretical Computer Science 302 2003 211 222
- (2003) Theoretical Computer Science , vol.302 , pp. 211-222
- Rytter, W.¹

7
- 56749185717
- Finding frequent patterns from compressed tree-structured data
- S. Murakami, K. Doi, A. Yamamoto, Finding frequent patterns from compressed tree-structured data, in: Proc. 11th Int. Conf. Discovery Science, 2008, pp. 284-295
- (2008) Proc. 11th Int. Conf. Discovery Science , pp. 284-295
- Murakami, S.¹ Doi, K.² Yamamoto, A.³

8
- 77950238328
- A space-saving approximation algorithm for grammar-based compression
- H. Sakamoto, S. Maruyama, T. Kida, and S. Shimozono A space-saving approximation algorithm for grammar-based compression IEICE Transactions on Information and Systems 92-D 2009 158 165
- (2009) IEICE Transactions on Information and Systems , vol.92 D , pp. 158-165
- Sakamoto, H.¹ Maruyama, S.² Kida, T.³ Shimozono, S.⁴

9
- 9444235150
- An effective grammar-based compression algorithm for tree structured data
- K. Yamagata, T. Uchida, T. Shoudai, Y. Nakamura, An effective grammar-based compression algorithm for tree structured data, in: Proc. 13th Int. Conf. Inductive Logic Programming, 2003, pp. 383-400
- (2003) Proc. 13th Int. Conf. Inductive Logic Programming , pp. 383-400
- Yamagata, K.¹ Uchida, T.² Shoudai, T.³ Nakamura, Y.⁴

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.