On the space complexity of some algorithms for sequence comparison

Yuval Rabani; Zvi Galil

doi:10.1016/0304-3975(92)90266-I

On the space complexity of some algorithms for sequence comparison

Yuval Rabani^*
, Zvi Galil

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Recent algorithms for computing the modified edit distance given convex or concave gap cost functions are shown to require Ω(n²) space for certain input.

Original language	English
Pages (from-to)	231-244
Number of pages	14
Journal	Theoretical Computer Science
Volume	95
Issue number	2
DOIs	https://doi.org/10.1016/0304-3975(92)90266-I
State	Published - 30 Mar 1992
Externally published	Yes

Access to Document

10.1016/0304-3975(92)90266-I

Cite this

@article{0ca6fe1d14484853a898a858b1fea8a2,

title = "On the space complexity of some algorithms for sequence comparison",

abstract = "Recent algorithms for computing the modified edit distance given convex or concave gap cost functions are shown to require Ω(n2) space for certain input.",

author = "Yuval Rabani and Zvi Galil",

year = "1992",

month = mar,

day = "30",

doi = "10.1016/0304-3975(92)90266-I",

language = "אנגלית",

volume = "95",

pages = "231--244",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - On the space complexity of some algorithms for sequence comparison

AU - Rabani, Yuval

AU - Galil, Zvi

PY - 1992/3/30

Y1 - 1992/3/30

N2 - Recent algorithms for computing the modified edit distance given convex or concave gap cost functions are shown to require Ω(n2) space for certain input.

AB - Recent algorithms for computing the modified edit distance given convex or concave gap cost functions are shown to require Ω(n2) space for certain input.

UR - https://www.scopus.com/pages/publications/0026838128

U2 - 10.1016/0304-3975(92)90266-I

DO - 10.1016/0304-3975(92)90266-I

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026838128

SN - 0304-3975

VL - 95

SP - 231

EP - 244

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2

ER -

On the space complexity of some algorithms for sequence comparison

Abstract

Access to Document

Other files and links

Fingerprint

Cite this