Finite automata based algorithms on subsequences and supersequences of degenerate strings-Reference-Cited by-同舟云学术

Finite automata based algorithms on subsequences and supersequences of degenerate strings

Published:2010-06 Issue:2 Volume:8 Page:117-130
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Iliopoulos Costas,Rahman M. Sohel,Voráček Michal,Vagner Ladislav

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference26 articles.

1. Algorithms for the constrained longest common subsequence problems;Arslan;Int. J. Found. Comput. Sci.,2005

2. A.N. Arslan, Ö. Eğecioğlu, Algorithms for the constrained longest common subsequence problems, in: Proceedings of the Prague Stringology Club Workshop '04, Prague, 2004, pp. 24–32

3. Searching subsequences;Baeza-Yates;Theoretical Computer Science,1991

4. An interactive system for multilevel design of technological processes of flexible production;Basin;Vestn. Mashinostr.,1987

5. A survey of longest common subsequence algorithms;Bergroth,2000

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing the longest common almost-increasing subsequence;Theoretical Computer Science;2022-09

2. A new approach to regular & indeterminate strings;Theoretical Computer Science;2021-01

3. Palindromic Subsequence Automata and Longest Common Palindromic Subsequence;Mathematics in Computer Science;2017-02-02

4. Indeterminate String Factorizations and Degenerate Text Transformations;Mathematics in Computer Science;2017-02-02

5. A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem;Green, Pervasive, and Cloud Computing;2016