Edit Distance in Near-Linear Time: it's a Constant Factor
We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant factor. Our result completes a research direction set forth in the recent breakthrough paper [1], which showed the first constant-factor app...
Saved in:
| Published in: | Proceedings / annual Symposium on Foundations of Computer Science pp. 990 - 1001 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.11.2020
|
| Subjects: | |
| ISSN: | 2575-8454 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant factor. Our result completes a research direction set forth in the recent breakthrough paper [1], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time. The recent results [2], [3] have shown near-linear complexity only under the restriction that the edit distance is close to maximal (equivalently, there is a near-linear additive approximation). In contrast, our algorithm obtains a constant-factor approximation in near-linear running time for any input strings. |
|---|---|
| AbstractList | We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant factor. Our result completes a research direction set forth in the recent breakthrough paper [1], which showed the first constant-factor approximation algorithm with a (strongly) sub-quadratic running time. The recent results [2], [3] have shown near-linear complexity only under the restriction that the edit distance is close to maximal (equivalently, there is a near-linear additive approximation). In contrast, our algorithm obtains a constant-factor approximation in near-linear running time for any input strings. |
| Author | Nosatzki, Negev Shekel Andoni, Alexandr |
| Author_xml | – sequence: 1 givenname: Alexandr surname: Andoni fullname: Andoni, Alexandr organization: Columbia University – sequence: 2 givenname: Negev Shekel surname: Nosatzki fullname: Nosatzki, Negev Shekel organization: Columbia University |
| BookMark | eNotzL1OwzAUQGGDQKIpPAEM3pgSrv992VBoACmiA9krJ7YlI-qgxAtvDwimbzk6FTnLcw6E3DBoGAO86_btm9QGoOHAoQEA1CekYoZbhpozcUo2XBlVW6nkBanW9R1AggK5IbjzqdDHtBaXp0BTpq_BLXWf8g90SMdwT1O5Xamj7Zx_q0I7N5V5uSTn0X2s4erfLRm63dA-1_3-6aV96OvENZY66CitcjYaDBYmYYQaZUQvUWuw1qLHUXquRuRcecuc14bHOHoQnI9abMn13zaFEA6fSzq65euAghkEKb4B45dGXQ |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/FOCS46700.2020.00096 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISBN | 1728196213 9781728196213 |
| EISSN | 2575-8454 |
| EndPage | 1001 |
| ExternalDocumentID | 9317904 |
| Genre | orig-research |
| GroupedDBID | --Z 29O 6IE 6IH 6IK ALMA_UNASSIGNED_HOLDINGS CBEJK RIE RIO |
| ID | FETCH-LOGICAL-i269t-e6f485a8f79e80c3735b4f9d496608889d9b4d25b9225d81ad672ffbd0322b63 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 26 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000652333400088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 05:54:41 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i269t-e6f485a8f79e80c3735b4f9d496608889d9b4d25b9225d81ad672ffbd0322b63 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_9317904 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-01 |
| PublicationDateYYYYMMDD | 2020-11-01 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings / annual Symposium on Foundations of Computer Science |
| PublicationTitleAbbrev | FOCS |
| PublicationYear | 2020 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040504 |
| Score | 2.4053128 |
| Snippet | We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 990 |
| SubjectTerms | Additives Approximation algorithms Complexity theory edit distance fine-grained complexity Measurement Signal processing algorithms sublinear algorithms Transforms |
| Title | Edit Distance in Near-Linear Time: it's a Constant Factor |
| URI | https://ieeexplore.ieee.org/document/9317904 |
| WOSCitedRecordID | wos000652333400088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VigEWHi3iLQ9ILJgmjhPnWEsjBiiVqFC3Kn5JWVLUpvx-bKe0CwuTLcuS5fd99n3fAdzZBLlUVtNU5toBFExoaWJOvTWHsSpVFCSFPl_FeJzPZjjpwMOWC2OMCc5n5tFnw1--Xqi1fyobYOL1pPge7AmRtVyt31PX2R0R31Dj4ggHxfvwg3sKioOAzHtvRUGWfxdAJdwfxdH_Wj6G_o6IRybbK-YEOqY-hcO3rdTqqgc40lVDnr0Z6GtXNRm7xUsdxnQJ8QyPJ1I19ytSkmFrCzakCEF2-jAtRtPhC93EQ6AVy7ChJrM8T8vcCjR5pBKRpJJb1NwrbDokixol1yyV6DapzuNSZ4JZK3Xkdq3MkjPo1ovanANJLbNapJKxMuax1qhQcVFq6dUEHYa5gJ4fg_lXq3gx33T_8u_iKzjwg9wy9K6h2yzX5gb21XdTrZa3YZp-AKq0kbc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB2VggRcWFrEjg9IXAhNHGcZrqVREW2oRIV6q-JNyiVFTcr3YyelvXDhZMuyZHmfZ897A3CvfWRcaOkEPJYGoKDvZMpjjrXm0BOZcGtJoc9RlKbxbIaTFjxuuDBKqdr5TD3ZbP2XLxdiZZ_KeuhbPSm2A7sBY9Rt2Fq_566xPFy2Jsd5LvaS9_4HsyQUAwKp9d9ya2H-bQiV-gZJjv7X9jF0t1Q8MtlcMifQUsUpHI43YqtlB3Ag84q8WEPQ1s4Lkprl6xiUaRJiOR7PJK8eSpKRfmMNViSpw-x0YZoMpv2hs46I4OQ0xMpRoWZxkMU6QhW7wo_8gDONklmNTYNlUSJnkgYczTaVsZfJMKJac-mafctD_wzaxaJQ50ACTbWMAk5p5jFPShQoWJRJbvUEDYq5gI4dg_lXo3kxX3f_8u_iO9gfTsej-eg1fbuCAzvgDV_vGtrVcqVuYE98V3m5vK2n7Adz_5T- |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%2F+annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=Edit+Distance+in+Near-Linear+Time%3A+it%27s+a+Constant+Factor&rft.au=Andoni%2C+Alexandr&rft.au=Nosatzki%2C+Negev+Shekel&rft.date=2020-11-01&rft.pub=IEEE&rft.eissn=2575-8454&rft.spage=990&rft.epage=1001&rft_id=info:doi/10.1109%2FFOCS46700.2020.00096&rft.externalDocID=9317904 |