File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/BF01185429
- Scopus: eid_2-s2.0-0028518079
- WOS: WOS:A1994PC55900004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Performance analysis of some simple heuristics for computing longest common subsequences
Title | Performance analysis of some simple heuristics for computing longest common subsequences |
---|---|
Authors | |
Keywords | Heuristics Longest common subsequence Performance analysis Scan algorithms |
Issue Date | 1994 |
Publisher | Springer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htm |
Citation | Algorithmica, 1994, v. 12 n. 4-5, p. 293-311 How to Cite? |
Abstract | Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years, heuristic methods have not been investigated before. In this paper we present a simple heuristic which guarantees to return a common subsequence of length at least 1/s that of the longest where s is the number of different symbols in the input strings. Furthermore, we generalize the idea to several classes of heuristic algorithms. Surprisingly, we find that no other heuristic in these classes outperforms this simple algorithm. In other words, we show that any heuristic which uses only global information, such as number of symbol occurrences, might return a common subsequence as short as 1/s of the length of the longest. Analysis of the average performance of the simple heuristic for s=2 is also presented. © 1994 Springer-Verlag New York Inc. |
Persistent Identifier | http://hdl.handle.net/10722/89032 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.905 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chin, F | en_HK |
dc.contributor.author | Poon, CK | en_HK |
dc.date.accessioned | 2010-09-06T09:51:32Z | - |
dc.date.available | 2010-09-06T09:51:32Z | - |
dc.date.issued | 1994 | en_HK |
dc.identifier.citation | Algorithmica, 1994, v. 12 n. 4-5, p. 293-311 | en_HK |
dc.identifier.issn | 0178-4617 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/89032 | - |
dc.description.abstract | Although the Longest Common Subsequence (LCS)Problem has been studied by many researchers for years, heuristic methods have not been investigated before. In this paper we present a simple heuristic which guarantees to return a common subsequence of length at least 1/s that of the longest where s is the number of different symbols in the input strings. Furthermore, we generalize the idea to several classes of heuristic algorithms. Surprisingly, we find that no other heuristic in these classes outperforms this simple algorithm. In other words, we show that any heuristic which uses only global information, such as number of symbol occurrences, might return a common subsequence as short as 1/s of the length of the longest. Analysis of the average performance of the simple heuristic for s=2 is also presented. © 1994 Springer-Verlag New York Inc. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Springer New York LLC. The Journal's web site is located at http://link.springer.de/link/service/journals/00453/index.htm | en_HK |
dc.relation.ispartof | Algorithmica | en_HK |
dc.subject | Heuristics | en_HK |
dc.subject | Longest common subsequence | en_HK |
dc.subject | Performance analysis | en_HK |
dc.subject | Scan algorithms | en_HK |
dc.title | Performance analysis of some simple heuristics for computing longest common subsequences | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0178-4617&volume=12&spage=293&epage=311&date=1994&atitle=Performance+analysis+of+some+simple+heuristics+for+computing+longest+common+subsequences | en_HK |
dc.identifier.email | Chin, F:chin@cs.hku.hk | en_HK |
dc.identifier.authority | Chin, F=rp00105 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/BF01185429 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0028518079 | en_HK |
dc.identifier.hkuros | 1191 | en_HK |
dc.identifier.volume | 12 | en_HK |
dc.identifier.issue | 4-5 | en_HK |
dc.identifier.spage | 293 | en_HK |
dc.identifier.epage | 311 | en_HK |
dc.identifier.isi | WOS:A1994PC55900004 | - |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Chin, F=7005101915 | en_HK |
dc.identifier.scopusauthorid | Poon, CK=7202673523 | en_HK |
dc.identifier.issnl | 0178-4617 | - |