@article{
 title = {Mathematical programming strategies for solving the minimum common string partition problem},
 type = {article},
 year = {2015},
 keywords = {isg_ehu,isg_jcr},
 pages = {769-777},
 volume = {242},
 id = {259b1444-6b8c-3320-b80d-b520fb8249aa},
 created = {2021-06-02T14:47:14.927Z},
 file_attached = {false},
 profile_id = {3b531ebc-e490-366b-8004-15c8c731a6be},
 group_id = {f2ba26fa-9910-3ec7-8a9f-d77fbd54c238},
 last_modified = {2021-06-02T14:47:14.927Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 source_type = {article},
 private_publication = {false},
 bibtype = {article},
 author = {},
 journal = {European Journal of Operational Research},
 number = {3}
}

{"_id":"HkwPjmCMYAgEfDuCW","bibbaseid":"mathematicalprogrammingstrategiesforsolvingtheminimumcommonstringpartitionproblem-2015","downloads":0,"creationDate":"2018-01-30T12:38:06.430Z","title":"Mathematical programming strategies for solving the minimum common string partition problem","author_short":[],"year":2015,"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/3b531ebc-e490-366b-8004-15c8c731a6be","bibdata":{"title":"Mathematical programming strategies for solving the minimum common string partition problem","type":"article","year":"2015","keywords":"isg_ehu,isg_jcr","pages":"769-777","volume":"242","id":"259b1444-6b8c-3320-b80d-b520fb8249aa","created":"2021-06-02T14:47:14.927Z","file_attached":false,"profile_id":"3b531ebc-e490-366b-8004-15c8c731a6be","group_id":"f2ba26fa-9910-3ec7-8a9f-d77fbd54c238","last_modified":"2021-06-02T14:47:14.927Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"source_type":"article","private_publication":false,"bibtype":"article","author":"","journal":"European Journal of Operational Research","number":"3","bibtex":"@article{\n title = {Mathematical programming strategies for solving the minimum common string partition problem},\n type = {article},\n year = {2015},\n keywords = {isg_ehu,isg_jcr},\n pages = {769-777},\n volume = {242},\n id = {259b1444-6b8c-3320-b80d-b520fb8249aa},\n created = {2021-06-02T14:47:14.927Z},\n file_attached = {false},\n profile_id = {3b531ebc-e490-366b-8004-15c8c731a6be},\n group_id = {f2ba26fa-9910-3ec7-8a9f-d77fbd54c238},\n last_modified = {2021-06-02T14:47:14.927Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n source_type = {article},\n private_publication = {false},\n bibtype = {article},\n author = {},\n journal = {European Journal of Operational Research},\n number = {3}\n}","author_short":[],"biburl":"https://bibbase.org/service/mendeley/3b531ebc-e490-366b-8004-15c8c731a6be","bibbaseid":"mathematicalprogrammingstrategiesforsolvingtheminimumcommonstringpartitionproblem-2015","role":"","urls":{},"keyword":["isg_ehu","isg_jcr"],"metadata":{"authorlinks":{}}},"search_terms":["mathematical","programming","strategies","solving","minimum","common","string","partition","problem"],"keywords":["isg_ehu","isg_jcr"],"authorIDs":[],"dataSources":["F7jCKzHzcjJZH8w9i","ya2CyA73rpZseyrZ8"]}