Technology Description

This invention is an algorithm for a graph theoretic approach to matching text strings or images. The invention addresses the problem of efficiently matching strings, with runtimes of N(log N) or, in certain cases, linear with N (where N is the size of the problem to be addressed).

Applications

• Database search and retrieval
• Quality control
• Inventory matching
• Polymorphic DNA analysis
• Surgical navigation
• Computer security

State Of Development

A software implementation is available for copyright licensing for research, academic, and non-profit purposes at this Web site.

Intellectual Property Info

This is an issued US patent (see 5,841,958). Licenses are available on a non-exclusive basis for a per-year fixed fee.

Related Materials

• Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasiconvex Tours

Patent Status

Country	Type	Number	Dated	Case
United States Of America	Issued Patent	5,841,958	11/24/1998	1994-B62

Other Information

Contact

University of California, San Diego Technology Transfer Office / invent@ucsd.edu / tel: View Phone Number. Please reference Tech ID #20049.

Request Additional Information