Standard
Greedy conjecture for strings of length 4. / Kulikov, Alexander S.; Savinov, Sergey; Sluzhaev, Evgeniy.
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. ed. / Ugo Vaccaro; Ely Porat; Ferdinando Cicalese. Springer Nature, 2015. p. 307-315 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9133).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Kulikov, AS, Savinov, S & Sluzhaev, E 2015,
Greedy conjecture for strings of length 4. in U Vaccaro, E Porat & F Cicalese (eds),
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9133, Springer Nature, pp. 307-315, 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015, Ischia Island, Italy,
29/06/15.
https://doi.org/10.1007/978-3-319-19929-0_26
APA
Kulikov, A. S., Savinov, S., & Sluzhaev, E. (2015).
Greedy conjecture for strings of length 4. In U. Vaccaro, E. Porat, & F. Cicalese (Eds.),
Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings (pp. 307-315). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9133). Springer Nature.
https://doi.org/10.1007/978-3-319-19929-0_26
Vancouver
Author
Kulikov, Alexander S. ; Savinov, Sergey ; Sluzhaev, Evgeniy. /
Greedy conjecture for strings of length 4. Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. editor / Ugo Vaccaro ; Ely Porat ; Ferdinando Cicalese. Springer Nature, 2015. pp. 307-315 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@inproceedings{5c031362427f4d938cf835658847a912,
title = "Greedy conjecture for strings of length 4",
abstract = "In this short note, we prove that the greedy conjecture for the shortest common superstring problem is true for strings of length 4.",
author = "Kulikov, {Alexander S.} and Sergey Savinov and Evgeniy Sluzhaev",
year = "2015",
month = jan,
day = "1",
doi = "10.1007/978-3-319-19929-0_26",
language = "English",
isbn = "9783319199283",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "307--315",
editor = "Ugo Vaccaro and Ely Porat and Ferdinando Cicalese",
booktitle = "Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings",
address = "Germany",
note = "26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 ; Conference date: 29-06-2015 Through 01-07-2015",
}
RIS
TY - GEN
T1 - Greedy conjecture for strings of length 4
AU - Kulikov, Alexander S.
AU - Savinov, Sergey
AU - Sluzhaev, Evgeniy
PY - 2015/1/1
Y1 - 2015/1/1
N2 - In this short note, we prove that the greedy conjecture for the shortest common superstring problem is true for strings of length 4.
AB - In this short note, we prove that the greedy conjecture for the shortest common superstring problem is true for strings of length 4.
UR - http://www.scopus.com/inward/record.url?scp=84949009862&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-19929-0_26
DO - 10.1007/978-3-319-19929-0_26
M3 - Conference contribution
AN - SCOPUS:84949009862
SN - 9783319199283
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 307
EP - 315
BT - Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings
A2 - Vaccaro, Ugo
A2 - Porat, Ely
A2 - Cicalese, Ferdinando
PB - Springer Nature
T2 - 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015
Y2 - 29 June 2015 through 1 July 2015
ER -
