Greedy conjecture for strings of length 4 › SPbU Researchers Portal

Greedy conjecture for strings of length 4

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Faculty of Mathemathics and Computer Sciences

DOI

https://doi.org/10.1007/978-3-319-19929-0_26
Final published version

Alexander S. Kulikov
Sergey Savinov
Evgeniy Sluzhaev

In this short note, we prove that the greedy conjecture for the shortest common superstring problem is true for strings of length 4.

Original language	English
Title of host publication	Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings
Editors	Ugo Vaccaro, Ely Porat, Ferdinando Cicalese
Publisher	Springer Nature
Pages	307-315
Number of pages	9
ISBN (Print)	9783319199283
DOIs	https://doi.org/10.1007/978-3-319-19929-0_26
State	Published - 1 Jan 2015
Event	26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 - Ischia Island, Italy Duration: 29 Jun 2015 → 1 Jul 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9133
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015
Country/Territory	Italy
City	Ischia Island
Period	29/06/15 → 1/07/15

Scopus subject areas

Theoretical Computer Science
Computer Science(all)

ID: 49824237