Staff View
Very efficient approximation algorithms to edit distance problems

Descriptive

TitleInfo
Title
Very efficient approximation algorithms to edit distance problems
Name (type = personal)
NamePart (type = family)
Naumovitz
NamePart (type = given)
Timothy Ryan
DisplayForm
Timothy Ryan Naumovitz
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Saks
NamePart (type = given)
Michael
DisplayForm
Michael Saks
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Saraf
NamePart (type = given)
Shubhangi
DisplayForm
Shubhangi Saraf
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Szegedy
NamePart (type = given)
Mario
DisplayForm
Mario Szegedy
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Andoni
NamePart (type = given)
Alexandr
DisplayForm
Alexandr Andoni
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2016
DateOther (qualifier = exact); (type = degree)
2016-10
CopyrightDate (encoding = w3cdtf); (qualifier = exact)
2016
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance between two permutations. Both of these problems are variants of the edit distance problem which, given two input sequences, is the minimum number of insertions and deletions (and in some cases, substitutions) needed to transform one sequence into the other. The distance to monotonicity of a sequence of n numbers is the minimum number of entries whose deletion leaves an increasing sequence. We give the first deterministic streaming algorithm that approximates the distance to monotonicity within a 1+ ε factor for any fixed ε > 0 and runs in space polylogarithmic in the length of the sequence and the range of the numbers. The best previous deterministic algorithm achieving the same approximation factor required space Ω(√ n) [13]. Previous polylogarithmic space algorithms were either randomized [22], or had approximation factor no better than 2 [9]. We also give polylogarithmic space lower bounds for this problem: Any deterministic streaming algorithm that gets a 1 + ε approximation requires space Ω( 1 ε log2 (n)) and any randomized algorithm requires space Ω( 1 ε log2 (n) log log(n) ). The Ulam distance between two permutations of length n is the minimum number of insertions and deletions needed to transform one sequence into the other. We provide an algorithm which, for any fixed ε > 0, gives a (1 + ε)-multiplicative approximation for the Ulam distance d in O˜ ε(n/d + √ n) time, which has been shown to be optimal up to polylogarithmic factors. This is the first sublinear time algorithm (provided that d = (log n) ω(1)) that obtains arbitrarily good multiplicative approximations to the Ulam distance. The previous best bound is an O(1)-approximation (with a large constant) by Andoni and Nguyen [4] with the same running time bound (ignoring polylogarithmic factors).
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = ETD-LCSH)
Topic
Computer algorithms
Subject (authority = ETD-LCSH)
Topic
Approximation theory
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_7676
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (vii, 104 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Timothy Ryan Naumovitz
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3J38VXK
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Naumovitz
GivenName
Timothy
MiddleName
Ryan
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2016-09-28 20:52:26
AssociatedEntity
Name
Timothy Naumovitz
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
CreatingApplication
Version
1.5
ApplicationName
pdfTeX-1.40.12
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2016-09-28T20:49:25
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2016-09-28T20:49:25
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024