Using swaps and deletes to make strings match
Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2015, Vol.562, p.606-620 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 620 |
|---|---|
| container_issue | |
| container_start_page | 606 |
| container_title | Theoretical computer science |
| container_volume | 562 |
| creator | Meister, Daniel |
| description | Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time. |
| doi_str_mv | 10.1016/j.tcs.2014.11.002 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1660052037</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397514008457</els_id><sourcerecordid>1660052037</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-a0bd8df2f83077991e20631e0161e5011cbe88ee1a9aa0f34c15a5c48d88707d3</originalsourceid><addsrcrecordid>eNp9kE9PwzAMxSMEEmPwAbj1yKXFbtomFSc08U-axIWdoyxxoaNrR5yB-PYEjTO-WJbes59_QlwiFAjYXG-K6LgoAasCsQAoj8QMtWrzsmyrYzEDCVUuW1WfijPmDaSqVTMT-Yr78TXjL7vjzI4-8zRQJM7ilG3tO2UcQxJwGqJ7OxcnnR2YLv76XKzu714Wj_ny-eFpcbvMnVQy5hbWXvuu7LQEpdoWqYRGIqWgSDUgujVpTYS2tRY6WTmsbe0q7bVWoLyci6vD3l2YPvbE0Wx7djQMdqRpzwabJuUvIV2bCzxIXZiYA3VmF_qtDd8GwfyiMRuT0JhfNAbRJDTJc3PwUPrhs6dg2PU0OvJ9IBeNn_p_3D8ElmpW</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1660052037</pqid></control><display><type>article</type><title>Using swaps and deletes to make strings match</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Meister, Daniel</creator><creatorcontrib>Meister, Daniel</creatorcontrib><description>Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2014.11.002</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Alphabets ; Computation ; Polynomial time ; Polynomials ; String edit distance ; String-to-string correction ; Strings</subject><ispartof>Theoretical computer science, 2015, Vol.562, p.606-620</ispartof><rights>2014 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-a0bd8df2f83077991e20631e0161e5011cbe88ee1a9aa0f34c15a5c48d88707d3</citedby><cites>FETCH-LOGICAL-c373t-a0bd8df2f83077991e20631e0161e5011cbe88ee1a9aa0f34c15a5c48d88707d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2014.11.002$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3550,4024,27923,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Meister, Daniel</creatorcontrib><title>Using swaps and deletes to make strings match</title><title>Theoretical computer science</title><description>Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time.</description><subject>Alphabets</subject><subject>Computation</subject><subject>Polynomial time</subject><subject>Polynomials</subject><subject>String edit distance</subject><subject>String-to-string correction</subject><subject>Strings</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNp9kE9PwzAMxSMEEmPwAbj1yKXFbtomFSc08U-axIWdoyxxoaNrR5yB-PYEjTO-WJbes59_QlwiFAjYXG-K6LgoAasCsQAoj8QMtWrzsmyrYzEDCVUuW1WfijPmDaSqVTMT-Yr78TXjL7vjzI4-8zRQJM7ilG3tO2UcQxJwGqJ7OxcnnR2YLv76XKzu714Wj_ny-eFpcbvMnVQy5hbWXvuu7LQEpdoWqYRGIqWgSDUgujVpTYS2tRY6WTmsbe0q7bVWoLyci6vD3l2YPvbE0Wx7djQMdqRpzwabJuUvIV2bCzxIXZiYA3VmF_qtDd8GwfyiMRuT0JhfNAbRJDTJc3PwUPrhs6dg2PU0OvJ9IBeNn_p_3D8ElmpW</recordid><startdate>2015</startdate><enddate>2015</enddate><creator>Meister, Daniel</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2015</creationdate><title>Using swaps and deletes to make strings match</title><author>Meister, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-a0bd8df2f83077991e20631e0161e5011cbe88ee1a9aa0f34c15a5c48d88707d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Alphabets</topic><topic>Computation</topic><topic>Polynomial time</topic><topic>Polynomials</topic><topic>String edit distance</topic><topic>String-to-string correction</topic><topic>Strings</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Meister, Daniel</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Meister, Daniel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Using swaps and deletes to make strings match</atitle><jtitle>Theoretical computer science</jtitle><date>2015</date><risdate>2015</risdate><volume>562</volume><spage>606</spage><epage>620</epage><pages>606-620</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>Given a source and a target string, their swap–delete–edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the target string. We show that the swap–delete–edit distance of strings over alphabets of bounded size can be computed in polynomial time.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2014.11.002</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2015, Vol.562, p.606-620 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1660052037 |
| source | Elsevier ScienceDirect Journals Complete; EZB-FREE-00999 freely available EZB journals |
| subjects | Alphabets Computation Polynomial time Polynomials String edit distance String-to-string correction Strings |
| title | Using swaps and deletes to make strings match |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T09%3A26%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Using%20swaps%20and%20deletes%20to%20make%20strings%20match&rft.jtitle=Theoretical%20computer%20science&rft.au=Meister,%20Daniel&rft.date=2015&rft.volume=562&rft.spage=606&rft.epage=620&rft.pages=606-620&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/j.tcs.2014.11.002&rft_dat=%3Cproquest_cross%3E1660052037%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1660052037&rft_id=info:pmid/&rft_els_id=S0304397514008457&rfr_iscdi=true |