Reversal Distance without Hurdles and Fortresses

Bergeron A, Mixtacki J, Stoye J (2004)
In: Proc. of CPM 2004. LNCS, 3109. SPRINGER-VERLAG BERLIN: 388-399.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Konferenzbeitrag | Veröffentlicht | Englisch
Autor
; ;
Abstract / Bemerkung
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.
Erscheinungsjahr
Titel des Konferenzbandes
Proc. of CPM 2004
Band
3109
Seite
388-399
Konferenz
CPM 2004
Konferenzort
Istanbul, Turkey
ISSN
PUB-ID

Zitieren

Bergeron A, Mixtacki J, Stoye J. Reversal Distance without Hurdles and Fortresses. In: Proc. of CPM 2004. LNCS. Vol 3109. SPRINGER-VERLAG BERLIN; 2004: 388-399.
Bergeron, A., Mixtacki, J., & Stoye, J. (2004). Reversal Distance without Hurdles and Fortresses. Proc. of CPM 2004, LNCS, 3109, 388-399. SPRINGER-VERLAG BERLIN. doi:10.1007/978-3-540-27801-6_29
Bergeron, A., Mixtacki, J., and Stoye, J. (2004). “Reversal Distance without Hurdles and Fortresses” in Proc. of CPM 2004 LNCS, vol. 3109, (SPRINGER-VERLAG BERLIN), 388-399.
Bergeron, A., Mixtacki, J., & Stoye, J., 2004. Reversal Distance without Hurdles and Fortresses. In Proc. of CPM 2004. LNCS. no.3109 SPRINGER-VERLAG BERLIN, pp. 388-399.
A. Bergeron, J. Mixtacki, and J. Stoye, “Reversal Distance without Hurdles and Fortresses”, Proc. of CPM 2004, LNCS, vol. 3109, SPRINGER-VERLAG BERLIN, 2004, pp.388-399.
Bergeron, A., Mixtacki, J., Stoye, J.: Reversal Distance without Hurdles and Fortresses. Proc. of CPM 2004. LNCS. 3109, p. 388-399. SPRINGER-VERLAG BERLIN (2004).
Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. “Reversal Distance without Hurdles and Fortresses”. Proc. of CPM 2004. SPRINGER-VERLAG BERLIN, 2004.Vol. 3109. LNCS. 388-399.