@InProceedings{bergeron04reversal,
  author    = {Anne Bergeron and Julia Mixtacki and Jens Stoye},
  title     = {Reversal Distance without Hurdles and Fortresses},
  booktitle = {Proc. of Combinatorial Pattern Matching Symposium (CPM 2004)},
  year      = {2004},
  volume    = {3109},
  series    = lncs,
  pages     = {388--399},
  publisher = Springer,
  abstract  = {This paper presents an elementary proof of the Hannenhalli-Pevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the various features of a permutation. The parameters called hurdles and fortress are replaced by a single one, whose value is computed by a simple and efficient algorithm.},
  file      = {BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:2004/BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:PDF},
  noaddress = {Berlin},
  noeditor  = {Sahinalp, S. C. and Muthukrishnan, S. and Dogrusoz, U.},
}

{"_id":"T3HFohRXpygvhWGK2","bibbaseid":"bergeron-mixtacki-stoye-reversaldistancewithouthurdlesandfortresses-2004","authorIDs":[],"author_short":["Bergeron, A.","Mixtacki, J.","Stoye, J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Anne"],"propositions":[],"lastnames":["Bergeron"],"suffixes":[]},{"firstnames":["Julia"],"propositions":[],"lastnames":["Mixtacki"],"suffixes":[]},{"firstnames":["Jens"],"propositions":[],"lastnames":["Stoye"],"suffixes":[]}],"title":"Reversal Distance without Hurdles and Fortresses","booktitle":"Proc. of Combinatorial Pattern Matching Symposium (CPM 2004)","year":"2004","volume":"3109","series":"Lect Notes Comput Sci","pages":"388–399","publisher":"Springer, Berlin","abstract":"This paper presents an elementary proof of the Hannenhalli-Pevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the various features of a permutation. The parameters called hurdles and fortress are replaced by a single one, whose value is computed by a simple and efficient algorithm.","file":"BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:2004/BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:PDF","noaddress":"Berlin","noeditor":"Sahinalp, S. C. and Muthukrishnan, S. and Dogrusoz, U.","bibtex":"@InProceedings{bergeron04reversal,\n author = {Anne Bergeron and Julia Mixtacki and Jens Stoye},\n title = {Reversal Distance without Hurdles and Fortresses},\n booktitle = {Proc. of Combinatorial Pattern Matching Symposium (CPM 2004)},\n year = {2004},\n volume = {3109},\n series = lncs,\n pages = {388--399},\n publisher = Springer,\n abstract = {This paper presents an elementary proof of the Hannenhalli-Pevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the various features of a permutation. The parameters called hurdles and fortress are replaced by a single one, whose value is computed by a simple and efficient algorithm.},\n file = {BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:2004/BergeronEtAl_ReversalDistanceWithoutHurdles_CPM_2004.pdf:PDF},\n noaddress = {Berlin},\n noeditor = {Sahinalp, S. C. and Muthukrishnan, S. and Dogrusoz, U.},\n}\n\n","author_short":["Bergeron, A.","Mixtacki, J.","Stoye, J."],"key":"bergeron04reversal","id":"bergeron04reversal","bibbaseid":"bergeron-mixtacki-stoye-reversaldistancewithouthurdlesandfortresses-2004","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:41.584Z","downloads":0,"keywords":[],"search_terms":["reversal","distance","without","hurdles","fortresses","bergeron","mixtacki","stoye"],"title":"Reversal Distance without Hurdles and Fortresses","year":2004,"dataSources":["C5FtkvWWggFfMJTFX"]}