Staff View
An O(n log n) algorithm for finding dissimilar strings

Descriptive

Language
LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Genre (authority = RULIB-FS)
Other
Genre (authority = marcgt)
technical report
PhysicalDescription
InternetMediaType
application/pdf
Extent
1 online resource (8 pages)
Note (type = special display note)
Technical report LCSR-TR-264
Name (type = corporate); (authority = RutgersOrg-School)
NamePart
School of Arts and Sciences (SAS) (New Brunswick)
Name (type = corporate); (authority = RutgersOrg-Department)
NamePart
Computer Science (New Brunswick)
TypeOfResource
Text
TitleInfo
Title
An O(n log n) algorithm for finding dissimilar strings
Subject (authority = local)
Topic
Algorithms
Subject (authority = local)
Topic
Analysis of algorithms
Subject (authority = local)
Topic
Combinatorial problems
Subject (authority = local)
Topic
Computational molecular biology
Subject (authority = local)
Topic
Probabilistic method
Subject (authority = local)
Topic
Lovasz local lemma
Abstract (type = abstract)
Let $Sigma$ be a finite alphabet and $x in Sigma^n$. A string $y in Sigma^m$ is said to be $k$-dissimilar to $x$, if no $k$ length substring of $x$ is equal to any $k$ length substring of $y$. We present an $O(n log n)$ algorithm which on input $x in Sigma^n$ and an integer $m leq n$ outputs an integer $k$ and $y in Sigma^m$ such that:
- $y$ is $k$-dissimilar to $x$.
- There does not exist a string $z$ of length $m$ which is $k-1$ dissimilar to $x$.
Name (type = personal)
NamePart (type = family)
Abbasi
NamePart (type = given)
Sarmad
Affiliation
Computer Science (New Brunswick)
Role
RoleTerm (type = text); (authority = marcrt)
author
Name (type = personal)
NamePart (type = family)
Sengupta
NamePart (type = given)
Anirvan
Affiliation
Bell Laboratories
Role
RoleTerm (type = text); (authority = marcrt)
author
OriginInfo
DateCreated (encoding = w3cdtf); (qualifier = exact); (keyDate = yes)
1996
RelatedItem (type = host)
TitleInfo
Title
Computer Science (New Brunswick)
Identifier (type = local)
rucore21032500001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/t3-befz-pn24
Back to the top

Rights

RightsDeclaration (AUTHORITY = rightsstatements.org); (TYPE = IN COPYRIGHT); (ID = http://rightsstatements.org/vocab/InC/1.0/)
This Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
Document
CreatingApplication
Version
1.4
ApplicationName
GPL Ghostscript 9.07
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:37:45
DateCreated (point = start); (encoding = w3cdtf); (qualifier = exact)
2018-06-06T12:37:45
Back to the top
Version 8.3.10
Rutgers University Libraries - Copyright ©2019