The rank distance is a low-complexity and robust distance between sequences, which has been used in computational linguistics and bioinformatics. We tackle the problem of maximizing rank distances; in particular, we solve the problem of exhibiting sequences at largest rank distance from a given binary sequence.
Maximum rank distance for binary strings
SGARRO, ANDREA
2008-01-01
Abstract
The rank distance is a low-complexity and robust distance between sequences, which has been used in computational linguistics and bioinformatics. We tackle the problem of maximizing rank distances; in particular, we solve the problem of exhibiting sequences at largest rank distance from a given binary sequence.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
