The efficient computation of complete and concise substring scales with suffix trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4390 LNAI, Issue , 2007, Pages 98-113

  Ferré, Sébastien ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY; WORD PROCESSING;

MULTI VALUED CONTEXTS; STRING VALUES; SUBSTRING SCALES; SUFFIX TREES;

TREES (MATHEMATICS);

EID: 38049052239     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70901-5_7     Document Type: Conference Paper

References (11)

1. R. Cole and G. Stumme. CEM - a conceptual email manager. In G. Mineau and B. Ganter, editors, Int. Conf. Conceptual Structures, LNCS 1867, pages 438-452. Springer, 2000.
2. S. Ferré and O. Ridoux. A logical generalization of formal concept analysis. In G. Mineau and B. Ganter, editors, Int. Conf. Conceptual Structures, LNCS 1867, pages 371-384. Springer, 2000.
3. S. Ferré and O. Ridoux. Searching for objects and properties with logical concept analysis. In H. S. Delugach and G. Stumme, editors, Int. Conf. Conceptual Structures, LNCS 2120, pages 187-201. Springer, 2001.
4. S. Ferré and O. Ridoux. A framework for developing embeddable customized logics. In A. Pettorossi, editor, Int. Work. Logic-based Program Synthesis and Transformation, LNCS 2372, pages 191-215. Springer, 2002.
5. S. Ferré and O. Ridoux. An introduction to logical information systems. Information Processing & Management, 40(3):383-419, 2004.
6. B. Ganter and S. Kuznetsov. Pattern structures and their projections. In H. S. Delugach and G. Stumme, editors, Int. Conf. Conceptual Structures, LNCS 2120, pages 129-142. Springer, 2001.
7. R. Godin, R. Missaoui, and A. April. Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. International Journal of Man-Machine Studies, 38(5) :747-767, 1993.
8. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
9. B. Ganter and R. Wille. Formal Concept Analysis - Mathematical Foundations. Springer, 1999.
10. S. Kuznetsov. Learning of simple conceptual graphs from positive and negative examples. In J. M. Zytkow and J. Rauch, editors, Principles of Data Mining and Knowledge Discovery, LNAI 1704, pages 384-391. Springer, 1999.
11. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3) :249-260, 1995.