home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / comp / theory / 1821 < prev    next >
Encoding:
Text File  |  1992-08-25  |  750 b   |  19 lines
  1. Newsgroups: comp.theory
  2. Path: sparky!uunet!brunix!brunix!rn
  3. From: rn@cs.brown.edu (Robert H.B. Netzer)
  4. Subject: string matching: need pointers
  5. Message-ID: <1992Aug25.193416.6264@cs.brown.edu>
  6. Followup-To: rn@cs.brown.edu
  7. Keywords: string matching
  8. Sender: news@cs.brown.edu
  9. Organization: Brown University Department of Computer Science
  10. Distribution: usa
  11. Date: Tue, 25 Aug 1992 19:34:16 GMT
  12. Lines: 5
  13.  
  14. Given two sets of strings (that are large binary files), I am interested in
  15. computing the set of longest identical sequences the two strings have in
  16. common.  Different sequences in the set may or may not overlap; both cases
  17. are of interest.  I'm interested in references to work on algorithms and
  18. the complexity of this and related matching problems.
  19.