Longest common subsequences in permutations and maximum cliques in circle graphs

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

Volumn 4009 LNCS, Issue , 2006, Pages 270-281

  Tiskin, Alexander ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

CIRCLE GRAPHS; LONGEST COMMON SUBSEQUENCE (LCS) PROBLEM; PERMUTATIONS;

GRAPH THEORY;

EID: 33746056885     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_25     Document Type: Conference Paper

References (14)

1. M. H. Albert, A. Golynski, A. M. Hamel, A. López-Ortiz, S. S. Rao, and M. A. Safari. Longest increasing subsequences in sliding windows. Theoretical Computer Science, 321:405-414, 2004.
2. C. E. R. Alves, E. N. Cáceres, and S. W. Song. An all-substrings common subsequence algorithm. Electronic Notes in Discrete Mathematics, 19:133-139, 2005.
3. A. Apostolico, M. J. Atallah, and S. E. Hambrusch. New clique and independent set algorithms for circle graphs, Discrete Applied Mathematics, 36:1-24, 1992.
4. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214-229, 1980.
5. S. Bespamyatnikh and M. Segal. Enumerating longest increasing subsequences and patience sorting. Information Processing Letters, 76:7-11, 2000.
6. E. Chen, H. Yuan, and L. Yang. Longest increasing subsequences in windows based on canonical antichain partition. In Proceedings of ISAAC, volume 3827 of Lecture Notes in Computer Science, pages 1153-1162, 2005.
7. E. W. Dijkstra. Some beautiful arguments using mathematical induction. Acta Informatica, 13:1-8, 1980.
8. S. Even and A. Itai. Queues, stacks and graphs. In Theory of Machines and Computations, pages 71-86. Academic Press, 1971.
9. F. Gavril. Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks, 3:261-273, 1973.
10. W.-L. Hsu. Maximum weight clique algorithms for circular-arc graphs and circle graphs. SIAM Journal on Computing, 14(1):224-231, 1985.
11. J. JaJa, C. Mortensen, and Q. Shi. Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In Proceedings of the 15th ISAAC, volume 3341 of Lecture Notes in Computer Science, pages 558-568, 2004.
12. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Efficient algorithms for finding maximum cliques of an overlap graph. Networks, 20:157-171, 1990.
13. D. Rotem and J. Urrutia. Finding maximum cliques in circle graphs. Networks, 11:269-278, 1981.
14. A. Tiskin. All semi-local longest common subsequences in subquadratic time. In Proceedings of CSR, volume 3967 of Lecture Notes in Computer Science, pages 352-363, 2006.