Inversions are a class of chromosomal mutations, widely regarded as one of the major mechanisms for reorganizing the genome. In this paper we present a new algorithm for the approximate string matching problem allowing for non-overlapping inversions which runs in O(nm) worst-case time and O(m2) space, for a character sequence of size n and pattern of size m. This improves upon a previous O(nm2)-time algorithm. In addition we present a variant of our algorithm with the same complexity in the worst case, but with a O(n) time complexity in the average case. This work has been supported by Istituto Nazionale di Alta Matematica "Francesco Severi".
Efficient string-matching allowing for non-overlapping inversions
CANTONE, Domenico;FARO, SIMONE
2013-01-01
Abstract
Inversions are a class of chromosomal mutations, widely regarded as one of the major mechanisms for reorganizing the genome. In this paper we present a new algorithm for the approximate string matching problem allowing for non-overlapping inversions which runs in O(nm) worst-case time and O(m2) space, for a character sequence of size n and pattern of size m. This improves upon a previous O(nm2)-time algorithm. In addition we present a variant of our algorithm with the same complexity in the worst case, but with a O(n) time complexity in the average case. This work has been supported by Istituto Nazionale di Alta Matematica "Francesco Severi".File | Dimensione | Formato | |
---|---|---|---|
2013 CantoneCristofaroFaro TCS.pdf
accesso aperto
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non specificato
Dimensione
612.17 kB
Formato
Adobe PDF
|
612.17 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.