Document Open Access Logo

The Longest Filled Common Subsequence Problem

Authors Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis

Thumbnail PDF


  • Filesize: 0.55 MB
  • 13 pages

Document Identifiers

Author Details

Mauro Castelli
Riccardo Dondi
Giancarlo Mauri
Italo Zoppis

Cite AsGet BibTex

Mauro Castelli, Riccardo Dondi, Giancarlo Mauri, and Italo Zoppis. The Longest Filled Common Subsequence Problem. In 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 78, pp. 14:1-14:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


Inspired by a recent approach for genome reconstruction from incomplete data, we consider a variant of the longest common subsequence problem for the comparison of two sequences, one of which is incomplete, i.e. it has some missing elements. The new combinatorial problem, called Longest Filled Common Subsequence, given two sequences A and B, and a multiset M of symbols missing in B, asks for a sequence B* obtained by inserting the symbols of M into B so that B* induces a common subsequence with A of maximum length. First, we investigate the computational and approximation complexity of the problem and we show that it is NP-hard and APX-hard when A contains at most two occurrences of each symbol. Then, we give a 3/5 approximation algorithm for the problem. Finally, we present a fixed-parameter algorithm, when the problem is parameterized by the number of symbols inserted in B that "match" symbols of A.
  • longest common subsequence
  • approximation algorithms
  • computational complexity
  • fixed-parameter algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, and Yoshiko Wakabayashi. Repetition-free longest common subsequence. Discrete Appl. Math., 158(12):1315-1324, 2010. URL:
  2. Paola Alimonti and Viggo Kann. Some apx-completeness results for cubic graphs. Theor. Comput. Sci., 237(1-2):123-134, 2000. URL:
  3. Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. J. ACM, 42(4):844-856, 1995. URL:
  4. Abdullah N. Arslan and Ömer Egecioglu. Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci., 16(6):1099-1109, 2005. URL:
  5. Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, and Marco Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Heidelberg, 1999. URL:
  6. Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, and Florian Sikora. On the parameterized complexity of the repetition free longest common subsequence problem. Inf. Process. Lett., 112(7):272-276, 2012. URL:
  7. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, and Stéphane Vialette. Exemplar longest common subsequence. IEEE/ACM Trans. Comput. Biol. Bioinform., 4(4):535-543, 2007. URL:
  8. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, and Yuri Pirola. Variants of constrained longest common subsequence. Inf. Process. Lett., 110(20):877-881, 2010. URL:
  9. Laurent Bulteau, Anna Paola Carrieri, and Riccardo Dondi. Fixed-parameter algorithms for scaffold filling. Theor. Comput. Sci., 568:72-83, 2015. URL:
  10. P. G. S. Chain and et al. Genomics. Genome project standards in a new era of sequencing. Science, 326:236-237, 2009. URL:
  11. Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, and S. K. Kim. A simple algorithm for the constrained sequence problems. Inf. Process. Lett., 90(4):175-179, 2004. URL:
  12. Carlos Eduardo Ferreira and Christian Tjandraatmadja. A branch-and-cut approach to the repetition-free longest common subsequence problem. Electron. Notes Discrete Math., 36:527-534, 2010. URL:
  13. Zvi Gotthilf, Danny Hermelin, and Moshe Lewenstein. Constrained LCS: hardness and approximation. In Paolo Ferragina and Gad M. Landau, editors, Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM 2008), volume 5029 of LNCS, pages 255-262. Springer, 2008. URL:
  14. Tao Jiang and Ming Li. On the approximation of shortest common supersequences and longest common subsequences. SIAM J. Comput., 24(5):1122-1139, 1995. URL:
  15. Nan Liu, Haitao Jiang, Daming Zhu, and Binhai Zhu. An improved approximation algorithm for scaffold filling to maximize the common adjacencies. IEEE/ACM Trans. Comput. Biol. Bioinform., 10(4):905-913, 2013. URL:
  16. Adriana Muñoz, Chunfang Zheng, Qian Zhu, Victor A. Albert, Steve Rounsley, and David Sankoff. Scaffold filling, contig fusion and comparative gene order inference. BMC Bioinformatics, 11:304, 2010. URL:
  17. Temple F. Smith and Michael S. Waterman. Identification of common molecular subsequences. J. Mol. Biol., 147(1):195-197, 1981. URL:
  18. Yin-Te Tsai. The constrained longest common subsequence problem. Inf. Process. Lett., 88(4):173-176, 2003. URL:
  19. Binhai Zhu. Genomic scaffold filling: A progress report. In Daming Zhu and Sergey Bereg, editors, Proceedings of the 10th International Workshop on Frontiers in Algorithmics (FAW 2016), volume 9711 of LNCS, pages 8-16. Springer, 2016. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail