A systolic array for approximate string matching
The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alph...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 405 |
|---|---|
| container_issue | |
| container_start_page | 402 |
| container_title | |
| container_volume | |
| creator | Sastry, R. Ranganathan, N. |
| description | The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer (1974), and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array is currently being built.< > |
| doi_str_mv | 10.1109/ICCD.1993.393344 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_proquest_miscellaneous_26271919</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>393344</ieee_id><sourcerecordid>26271919</sourcerecordid><originalsourceid>FETCH-LOGICAL-i203t-fc45ffd860f780e5cd6d47053348b33d9df789cfc015fa0c208d562b5be191493</originalsourceid><addsrcrecordid>eNotj0tLxDAURgMiqOPsxVVW7lpvnk2WQ30NDLjRdUnz0EhnWpMO2H9vZLyb-_FxuJyL0A2BmhDQ99u2faiJ1qxmmjHOz9AVKKIkpwzgAq1z_oIyQiho5CWCDc5LnschWmxSMgsOY8JmmtL4E_dm9jjPKR4-cMn2s4RrdB7MkP36f6_Q-9PjW_tS7V6ft-1mV0UKbK6C5SIEpySERoEX1knHGxBFSfWMOe1Kr22wQEQwYCkoJyTtRe-JJlyzFbo73S0m30ef524fs_XDYA5-POaOStoU8g-8PYHRe99NqVinpTs9z34BKuhO0A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>26271919</pqid></control><display><type>conference_proceeding</type><title>A systolic array for approximate string matching</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sastry, R. ; Ranganathan, N.</creator><creatorcontrib>Sastry, R. ; Ranganathan, N.</creatorcontrib><description>The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer (1974), and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array is currently being built.< ></description><identifier>ISBN: 0818642300</identifier><identifier>ISBN: 9780818642302</identifier><identifier>DOI: 10.1109/ICCD.1993.393344</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Computer architecture ; Computer science ; Costs ; Dynamic programming ; Heuristic algorithms ; Information retrieval ; Microelectronics ; Pattern recognition ; Systolic arrays ; Very large scale integration</subject><ispartof>Computer Design: VLSI in Computers and Processors (ICCD '93, 1993, p.402-405</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/393344$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,2051,4035,4036,27903,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/393344$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sastry, R.</creatorcontrib><creatorcontrib>Ranganathan, N.</creatorcontrib><title>A systolic array for approximate string matching</title><title>Computer Design: VLSI in Computers and Processors (ICCD '93</title><addtitle>ICCD</addtitle><description>The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer (1974), and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array is currently being built.< ></description><subject>Computer architecture</subject><subject>Computer science</subject><subject>Costs</subject><subject>Dynamic programming</subject><subject>Heuristic algorithms</subject><subject>Information retrieval</subject><subject>Microelectronics</subject><subject>Pattern recognition</subject><subject>Systolic arrays</subject><subject>Very large scale integration</subject><isbn>0818642300</isbn><isbn>9780818642302</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1993</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj0tLxDAURgMiqOPsxVVW7lpvnk2WQ30NDLjRdUnz0EhnWpMO2H9vZLyb-_FxuJyL0A2BmhDQ99u2faiJ1qxmmjHOz9AVKKIkpwzgAq1z_oIyQiho5CWCDc5LnschWmxSMgsOY8JmmtL4E_dm9jjPKR4-cMn2s4RrdB7MkP36f6_Q-9PjW_tS7V6ft-1mV0UKbK6C5SIEpySERoEX1knHGxBFSfWMOe1Kr22wQEQwYCkoJyTtRe-JJlyzFbo73S0m30ef524fs_XDYA5-POaOStoU8g-8PYHRe99NqVinpTs9z34BKuhO0A</recordid><startdate>1993</startdate><enddate>1993</enddate><creator>Sastry, R.</creator><creator>Ranganathan, N.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>1993</creationdate><title>A systolic array for approximate string matching</title><author>Sastry, R. ; Ranganathan, N.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i203t-fc45ffd860f780e5cd6d47053348b33d9df789cfc015fa0c208d562b5be191493</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Computer architecture</topic><topic>Computer science</topic><topic>Costs</topic><topic>Dynamic programming</topic><topic>Heuristic algorithms</topic><topic>Information retrieval</topic><topic>Microelectronics</topic><topic>Pattern recognition</topic><topic>Systolic arrays</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Sastry, R.</creatorcontrib><creatorcontrib>Ranganathan, N.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sastry, R.</au><au>Ranganathan, N.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A systolic array for approximate string matching</atitle><btitle>Computer Design: VLSI in Computers and Processors (ICCD '93</btitle><stitle>ICCD</stitle><date>1993</date><risdate>1993</risdate><spage>402</spage><epage>405</epage><pages>402-405</pages><isbn>0818642300</isbn><isbn>9780818642302</isbn><abstract>The edit distance between two strings is defined as the minimum cost of a sequence of editing operations (insertions, deletions and substitutions) that convert one string into the other. This paper presents a linear systolic array for computing the edit distance between two strings over a given alphabet. An encoding scheme is proposed which reduces the number of bits required to represent a state in the computation. The architecture is a parallel realization of the standard dynamic programming algorithm proposed by Wagner and Fischer (1974), and can perform approximate string matching for variable edit costs. More importantly, the architecture does not place any constraint on the lengths of the strings that can be compared. It makes use of simple basic cells and requires regular nearest-neighbor communication, which makes it suitable for VLSI implementation. A prototype of this array is currently being built.< ></abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/ICCD.1993.393344</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 0818642300 |
| ispartof | Computer Design: VLSI in Computers and Processors (ICCD '93, 1993, p.402-405 |
| issn | |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26271919 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer architecture Computer science Costs Dynamic programming Heuristic algorithms Information retrieval Microelectronics Pattern recognition Systolic arrays Very large scale integration |
| title | A systolic array for approximate string matching |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T01%3A59%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20systolic%20array%20for%20approximate%20string%20matching&rft.btitle=Computer%20Design:%20VLSI%20in%20Computers%20and%20Processors%20(ICCD%20'93&rft.au=Sastry,%20R.&rft.date=1993&rft.spage=402&rft.epage=405&rft.pages=402-405&rft.isbn=0818642300&rft.isbn_list=9780818642302&rft_id=info:doi/10.1109/ICCD.1993.393344&rft_dat=%3Cproquest_6IE%3E26271919%3C/proquest_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26271919&rft_id=info:pmid/&rft_ieee_id=393344&rfr_iscdi=true |