US 7,680,790 B2Grant
Method and apparatus for approximate matching of DNA sequences
Issue Date:2010-03-16
•24 Claims
•7 Drawing Sheets
Abstract
A method and device are disclosed for an associative and approximate, analog or digital scanning of databases that allows for the asynchronous accessing of data from a mass storage medium. The invention includes providing dedicated analog and digital circuitry and decision logic at the mass storage medium level for determining a key identifying the data of interest, continuously comparing the key to a signal generated from a reading of the data from the mass storage medium with an approximate or exact matching circuit to determine a pattern match, determining a correlation value between the key and the data as it is read in a continuous fashion, and determining a match based upon a preselected threshold value for the correlation value. The pattern matching technique eliminates any need to compare data based on its intrinsic structure or value, and instead is based on an analog or digital pattern. The key and data may be either analog or digital. This device and method may be provided as part of a stand-alone computer system, embodied in a network attached storage device, or can otherwise be provided as part of a computer LAN or WAN.
Metadata
Assignee
- Washington University
Inventors
- Ronald S. Indeck
- Ron Kaplan Cytron
- Mark Allen Franklin
Application Information
Application Number:US 11/932,321
Filing Date:2007-10-31
Priority Date:2000-04-07
Art Unit:2162
Classifications
IPC:
G06F7/00G06F17/30
Patent Drawings (7 sheets)
Description
Cross-Reference and Priority Claims to Related Applications
[0001] This application is a continuation of U.S. application Ser. No. 11/621,001, filed Jan. 8, 2007, and entitled “Associative Database Scanning and Information Retrieval”, which is a continuation application of U.S. application Ser. No. 10/722,691, filed on Nov. 24, 2003, and entitled “Associative Database Scanning and Information Retrieval”, now U.S. Pat. No. 7,181,437, which is a continuation of U.S. application Ser. No. 09/545,472, filed Apr. 7, 2000, entitled “Associative Database Scanning and Information Retrieval”, now U.S. Pat. No. 6,711,558, the entire disclosures of each of which are incorporated herein by reference.
Background of the Invention
[0002] Associative memory devices are known in the prior art. Generally, these associative memory devices comprise peripheral memories for computers, computer networks, and the like, which operate asynchronously to the computer, network, etc. and provide increased efficiency for specialized searches. Additionally, it is also known in the prior art that these memory devices can include certain limited decision-making logic as an aid to a main CPU in accessing the peripheral memory. An example of such an associative memory device particularly adapted for use with a rotating memory such as a high speed disk or drum can be found in U.S. Pat. No. 3,906,455, the disclosure of which is incorporated herein by reference. This particular device provides a scheme for use with a rotating memory and teaches that two passes over a memory sector is necessary to presort and then sort the memory prior to performing any logical operations thereon. Thus, this device is taught as not being suitable for use with any linear or serial memory such as magnetic tape or the like.
[0003] Other examples of prior art devices may also be found in U.S. Pat. Nos. 3,729,712; 4,464,718; 5,050,075; 5,140,692; and 5,721,898; the disclosures of which are incorporated herein by reference.
[0004] As an example, in U.S. Pat. No. 4,464,718, Dixon performs fixed comparisons on a fixed number of bytes. They don't have the ability to scan and correlate arbitrarily over the data. They search serially along the tracks in a given disk cylinder but there is no provision for parallel searching across disks. Dixon's comparisons are limited by a fixed rigid number of standard logical operation types. Additionally, the circuitry presented supports only these single logical operations. There is no support for approximate or fuzzy matching.
[0005] While these prior art associative memory devices represent an attempt to speed the input and output of information to and from a peripheral memory, which in many cases is a mass storage memory device, all rely on the classic accessing of data stored in digital form by reading and interpreting the digital either address or content of the memory location. In other words, most such devices access data by its address but there are some devices that take advantage of the power of content addressing as is well known in the art. Nevertheless, in all of the prior art known to the inventors, the digital value of the address or data contained in the addressed location must be read and interpreted in its digital form in order to identify the data and then select it for processing. Not only does it take processing time to read and interpret the digital data represented by the address or content, this necessarily requires that the accessing circuit process the memory according to the structure of the data stored. In other words, if the data is stored in octets, then the accessing circuitry must access the data in octets and process it in an incremental manner. This “start and stop” processing serves to increase the input/output time required to access data. As is also well known in the art, this input/output time typically represents the bottleneck and effective limitation of processing power in any computer or computer network.
[0006] In order to solve these and other problems in the prior art, the inventors herein have succeeded in designing and developing a method and apparatus for an associative memory in several embodiments which provide an elegantly simple solution to these prior art limitations as well as dramatically decreased access times for data stored in mass storage memories. As mentioned, the invention has several embodiments each of which has its own advantages.
[0007] Generally, the invention may be described as a technique for data retrieval through approximate matching of a data key with a continuous reading of data as stored on a mass storage medium. In its broadest, and perhaps most powerful, embodiment, this key may be an analog signal and it is matched with an analog signal generated by a typical read/write device as it slews across the mass storage medium. In other words, the steps taught to be required in the prior art of not only reading the analog representation of digital data stored on the mass storage medium but also the conversion of that signal to its digital format prior to being compared are eliminated. Furthermore, there is no requirement that the data be “framed” or compared utilizing the structure or format in which the data has been organized and stored. For an analog signal, all that need be specified is the elapsed time of that signal which is used for comparison with a corresponding and continuously changing selected time portion of the “read” signal. Using any one of many standard correlation techniques as known in the prior art, the data “key” may then be approximately matched to the sliding “window” of data signal to determine a match. Significantly, the same amount of data may be scanned much more quickly and data matching the search request may be determined much more quickly as well. For example, the inventors have found that CPU based approximate searches of 200 megabytes of DNA sequences can take up to 10 seconds on a typical present day “high end” system, assuming the offline processing to index the database has already been completed. In that same 10 seconds, the inventors have found that a 10-gigabyte disk could be magnetically searched for approximate matches using the present invention. This represents a 50:1 improvement in performance. Furthermore, in a typical hard disk drive there are four surfaces and corresponding read/write heads, which may be all searched in parallel should each head be equipped with the present invention. As these searches can proceed in parallel, the total increase in speed or improvement represents a 200:1 advantage. Furthermore, additional hard disk drives may be accessed in parallel and scaled to further increase the advantage provided by the present invention.
[0008] By choosing an appropriate correlation or matching technique, and by setting an appropriate threshold, the search may be conducted to exactly match the desired signal, or more importantly and perhaps more powerfully, the threshold may be lowered to provide for approximate matching searches. This is generally considered a more powerful search mode in that databases may be scanned to find “hits” which may be valid even though the data may be only approximately that which is being sought. This allows searching to find data that has been corrupted, incorrectly entered data, data which only generally corresponds to a category, as well as other kinds of data searches that are highly desired in many applications. For example, a library of DNA sequences may be desired to be searched and hits found which represent an approximate match to a desired sequence of residues. This ensures that sequences which are close to the desired sequence are found and not discarded but for the difference in a forgivable number of residue mismatches. Still another application involves Internet searches provided by Internet search engines. In such a search, approximate matching allows for misspelled words, differently spelled words, and other variations to be accommodated without defeating a search or requiring a combinatorial number of specialized searches. This technique permits a search engine to provide a greater number of hits for any given search and ensure that a greater number of relevant web pages are found and cataloged in the search.
[0009] Still another possible application for the present invention is for accessing databases which may be enormous in size or which may be stored as analog representations. For example, our society has seen the implementation of sound recording devices and their use in many forums including judicial proceedings. In recent history, tape recordings made in the President's oval office have risen in importance with respect to impeachment hearings. As can be appreciated, tape recordings made over the years of a presidency can accumulate into a huge database which might require a number of persons to actually listen to them in order to find instances where particular words are spoken that might be of interest. Utilizing the present invention, an analog representation of that spoken word can be used as a key and sought to be matched while the database is scanned in a continuous manner and at rapid speed. Thus, the present invention provides a powerful search tool for massive analog databases as well as massive digital databases.
[0010] While text-based searches are accommodated by the present invention as described above, storage media containing pictures, sound, and other representations have traditionally been more difficult to search than text. The present invention allows searching a large data space for the presence of such content or fragments thereof. For example, the key in this case could be a row or quadrant of pixels that represent the image being sought. Approximate matching of the key's signal can then allow identification of matches or near matches to the key.
[0011] While the principal advantages and features of the present invention have been briefly explained above, a more thorough understanding of the invention may be attained by referring to the drawings and description of the preferred embodiment which follow.
Brief Description of the Drawings
[0012] FIG. 1 is a block diagram of a computer having access through its system or input/output bus to the present invention comprising the logical mass storage medium for asynchronous access thereto, as well as a network interface between the present invention and a network to other computer systems;
[0013] FIG. 1A is a schematic for a conventional rigid disk drive system illustrating different insertion points for connection of the present invention;
[0014] FIG. 2 is a block diagram depicting the implementation of the present invention in a stand-alone configuration;
[0015] FIG. 3 is a block diagram depicting the present invention implemented as a shared remote mass storage device across a network;
[0016] FIG. 4 is a block diagram depicting the present invention as a network attached storage device (NASD);
[0017] FIG. 5 is a flow chart detailing the logical steps in the inventive method for accessing data in a mass storage medium;
[0018] FIG. 6 is a graphical representation of an analog signal as might be used as a key;
[0019] FIG. 7 is a graphical representation of an analog signal representing the continuous reading of data from a mass storage medium in which the “key” data pattern is present;
[0020] FIG. 8 is a graphical representation of the key signal overlying and matched to the data signal;
[0021] FIG. 9 is a graphical representation of a correlation function calculated continuously as the data in the mass storage medium is scanned and compared with the key; and
[0022] FIG. 10 is a graphical representation of a correlation function as the key is continuously compared with a signal taken from reading a different set of data but which also contains the “key” data pattern.
Detailed Description of the Preferred Embodiment
[0023] As shown in FIG. 1 , the present invention is readily implemented in a stand-alone computer or computer system. In broad terms, the present invention is comprised of an approximate matching and pre-fetch processor 20 which itself comprises a programmable digital logic device or microprocessor 22 coupled to an approximate matching unit 24. A mass storage medium 26 is connected to the approximate matching unit 24 and provides the medium for storing large amounts of data. The term “mass storage medium” should be understood as meaning any device used to store large amounts of data, and which is typically designated for use in a computer or computer network. Examples include optical systems such as CD ROMS, magnetic systems such as hard disk drives or sub-units such as a single disk surface, and these systems may be rotating, linear, serial, parallel, or various combinations of each. For example, a rack of hard disk drive units could be connected in parallel and their parallel output provided at the transducer level to one or more approximate matching units 24. Similarly, a bank of magnetic tape drives could be used, and their serial outputs each provided in parallel to one or more approximate matching units 24. The data stored on the medium may be in analog or in digital form. For example, the data could be voice recordings as in the tape recording example given above. The present invention is thus scalable, permitting an increase in the amount of data stored in a mass storage system (by increasing the number of parallel storage units) while preserving the performance (by increasing the number of parallel approximate matching units or replicating the approximate matching and prefetch processor).
[0024] In the prior art as shown in the upper portion of FIG. 1 , typically a disk controller 28 and/or a disk cache 30 may be used in the traditional sense for access by a CPU 32 over its system or input/output bus 34. In the present invention, the approximate matching and pre-fetch processor 20 accesses data in the mass storage medium 26 and presents it for use at the system bus 34 without moving large blocks of memory from the mass storage medium 26 over the system bus 34 and into the main memory (not separately shown) of CPU 32 for sorting and accessing. In other words, as is explained in greater detail below, the CPU 32 sends a data request or query to the approximate matching and pre-fetch processor 20 which then asynchronously accesses and sorts data in the mass storage medium 26 and presents it for use either in a disk cache 30 as is known in the prior art or directly onto the system bus 34 without further processing being required by CPU 32 or use of its main memory. The processor is thus free to perform other tasks while the searching and matching activity is being performed by the present invention.
[0025] The approximate matching unit 24 may itself comprise a set of digital logic or analog circuitry organized to perform scanning, correlation, general logic and approximate matching functions on the signals received from the storage medium in conjunction with digital or analog representations of query directed key information. The functions may be performed by dedicated logic and circuitry, programmable logic and circuitry or by use of programmable processors such as digital signal processors (DSPs). The inventors contemplate that many different variations of hardware or programmed software devices may be used to virtually equal advantage in implementing the present invention and therefore do not contemplate any particular implementation as a better mode than another, at present, except as otherwise expressed herein. Furthermore, the present invention should not be considered as being tied to any specific data structure or application, those having been used herein are instead to be viewed as illustrative only. Using the present disclosure as a template, it is contemplated that one of ordinary skill in the art could readily construct a device as would perform the functions and operation necessary to achieve the purposes of the invention.
[0026] As has been explained above, the present invention may be used to perform both exact matches and approximate matches. When performing an exact match in the analog domain, at Point A in FIG. 1A , where matching is done using analog comparators and correlation techniques, there an exact match corresponds to setting a sufficiently high threshold value for matching the key with analog source data on the storage medium. Approximate matching in this analog domain corresponds to setting appropriate (lesser) threshold values. When performing an exact match in the digital domain, an exact match is performed using digital comparators and logic as suggested in current art, where a digital key is compared with digital source data from the storage medium. Such matching could be performed at Point B or Point C, as shown in FIG. 1A , which corresponds to the pre- and post-error-corrected digital signal, respectively. Approximate matching in this domain corresponds to performing comparisons or digital correlation of the digital key with digital source data obtained from the storage medium. The digital key may contain “wild card” or “don't care” digital bits or data formats. The success of an approximate match may be determined by setting a correlation value or by using one of a number of matching-performance metrics such as the number of bits within a key that are equal to the corresponding bits in the scanned source data. Also, note that the data entries identified in an “approximate” match search will include the “exact” hits that would result from an “exact” search. For clarity, when the word “match” is used, the reader should understand that it includes a search or a data result found through either of an approximate search or an exact search. When the phrase “approximate match” or even just “approximate” is used, the reader should understand that it could be either of the two searches described above as approximate searches, or for that matter any other kind of “fuzzy” search that has a big enough net to gather data entries that are loosely related to the search criteria. Of course, an exact match is just that, and does not include any result other than an exact match of the search criteria with a high degree of correlation.
[0027] The microprocessor or programmable logic device 22 may itself comprise one or more microprocessors, programmable logic units, dedicated logic and associated circuitry. This unit interfaces with the system or input/output bus 34 and, in one configuration, also interfaces with any disk caches 30 which may be present. The unit receives and processes requests and queries from the CPU 32 or network interface 36 and presents these requests in the appropriate form to approximate matching unit 24. Additionally the unit may aid in passing the results of the requests to either or both the disk cache 30 and/or the CPU 32 (by way of the bus 34).
[0028] More particularly, as shown in FIG. 1A , a conventional rigid disk drive may have a plurality of rotating disks with multiple transducers accessing each disk. Each of these transducers typically has its output feeding analog signal electronics, such as amplifiers. This is represented at point A in the Figure. The Approximate Matching and Pre-fetch Processor (AMPP) 20, or the AMU 24, may be installed at point A for analog matching. As further shown in FIG. 1A , typically the outputs of the analog circuitry are selectively provided to a single digital decoder which then processes one such output. This is represented at point B in the Figure. This digital output is typically then sent through error correction circuitry (ECC) and at its output C is then passed on to the bus 34 or disk cache 30. For purposes of the present invention, it may be desirable to provide multiple parallel paths for data by providing multiple digital decoders and ECC's. The Approximate Matching and Pre-fetch Processor (AMPP) 20, or the AMU 24, may be installed at either of points B or C for digital matching, and for multiple data output, multiple AMPP's or AMU's may also be provided.
[0029] Also shown in FIG. 1 is a network interface 36 interconnecting the present invention 20, a network 38 which may be a LAN, WAN, Internet, etc. and to which other computer systems 40 may be connected. With this arrangement, other computer systems 40 may conveniently also access the data stored on the mass storage medium 26 through the present invention 20. More specific examples are given below.
[0030] As shown in FIGS. 2-4 , the present invention may be implemented in a variety of computer and network configurations. As shown in FIG. 2 , the present invention may be provided as part of a stand-alone computer system 42 comprising a CPU 44 connected to a system bus 46 which then accesses a mass storage medium 48 having the invention as disclosed herein.
[0031] As shown in FIG. 3 , the mass storage medium 50 coupled with the present invention may be itself connected directly to a network 52 over which a plurality of independent computers or CPU's 54 may then access the intelligent mass storage medium 50. The intelligent mass storage medium 50 may itself be comprised of a bank of hard disk drives comprising a RAID, disk farm, or some other massively parallel memory device configuration to provide access and approximate matching capabilities to enormous amounts of data at significantly reduced access times.
[0032] As shown in FIG. 4 , an intelligent mass storage medium 56 equipped with the present invention may be connected to a network 58 as a Network Attached Storage Device (NASD) such that over the network 58 a plurality of stand-alone computers 60 may have access thereto. With the configuration as shown in FIG. 4 , it is contemplated that each data storage device, represented as a disk in FIG. 4 , would be accessible from any processor connected to the network. One such configuration would include assigning a unique IP address or other network address to each data storage medium.
[0033] The configurations as exemplified by those shown in FIGS. 2-4 represent only examples of the various computer and network configurations with which the present invention would be compatible and highly useful. Others would be apparent to those having skill in the art and the present invention is not intended to be limited through the examples as shown herein which are meant to be instead illustrative of the versatility of the present invention.
[0034] As shown in FIG. 5 , the method of the present invention is described alternatively with respect to whether an analog or digital key is used. However, beginning at the start of the method, a CPU performs certain functions during which it may choose to access data stored in a mass storage medium. Typically, the CPU runs an application 62 which may be a DNA search, an Internet search, an analog voice search, a fingerprint search, an image search, or some other such search during which an approximate (or exact) match to data is desired. In executing that higher order language application, the CPU would typically execute a request or query to obtain information from the storage device 26. The query contains directives specifying various parameters which the disk control unit 28 and the approximate matching and prefetch processor 20 must have to properly obtain requested information from the storage device 26. Examples of parameters include but are not limited to the following: the starting location for scanning the storage device; the final location after which (if there is not match) scanning is terminated; the key to be used in the scanning; a specification of the approximate nature of the matching; what information should be returned when a match occurs, etc. The sort of information that can be returned includes the address of the information where the match was found, or a sector, record, portion of record or other data aggregate which contains the matched information. The data aggregate may also be dynamically specified in that the data returned on a match may be specified to be between bounding data specifiers with the matched data contained within the bounding field. For example, looking for the word “terrorist” in a string of text might find the approximate match, due to misspelling, of the word “terrerist”, and return a data field which is defined by the surrounding sentence. Another query parameter would indicate whether the returned information should be sent to the system or input/output bus 34, or the disk cache 30.
[0035] The query will typically result in the execution of one or more operating system utilities. As an example of a higher level utility command, for the UNIX operating system, this could be modified versions of glimpse, find, grep, apropos. Other such functions causing the CPU to send commands 66 such as search, approximate search, etc., to the approximate matching and pre-fetch processor of the present invention (see FIG. 1 ) with relevant portions of these commands also being sent to the disk controller 28 to, for example, initiate any mass storage media positioning activity 69 that is later required for properly reading information from the media.
[0036] At this point, depending upon the particular methodology desired to be implemented in the particular embodiment of the invention, it would be necessary that an analog or digital key is determined. This key is data, exact or approximate, that corresponds to the data being searched for. For an analog key, this key may either be pre-stored such as in the mass storage medium, developed using dedicated circuitry, or required to be generated. Should the analog key be pre-stored, a send pre-stored key step 68 would be performed by the microprocessor or programmable logic device 22 (see FIG. 1 ) which would transmit the key in digital and sampled format to the approximate matching unit 24 as shown in step 70. Alternatively, should the analog key not be pre-stored, the analog key can be developed using one of a number of mechanisms, two of which are shown in FIG. 5 . In one the microprocessor 22 would write the key on the magnetic medium as at step 72 and then next read the key as at step 74 in order to generate an analog signal representation of the key. In another as at step 71 the digital version of the key received from the CPU would be converted using appropriate digital to analog circuitry to an analog signal representation which would in turn be appropriately sampled. The key would then next be stored as a digital sample thereof as in step 70. Should a digital key be used, it is only necessary that the microprocessor 22 store the digital key as at step 76 in approximate matching unit 24. It should be understood that depending upon the particular structures desired to be included for each of the microprocessor 22 and approximate matching unit 24, the key may reside in either or all of these components, it merely being preferable to ultimately get the appropriate digital format for the key into the approximate matching unit 24 for comparison and correlation. Next, after the mass storage device reaches its starting location as at 79, the data stored on the mass storage medium 26 is continuously read as at step 78 to generate a continuous stream signal representative of the data stored in the mass storage medium 26. Should an analog key have been used, this analog key may then be correlated with an analog read of data from the mass storage medium 26 as at step 80. While the inventors contemplate that any of many prior art comparators and correlation circuitry could be used, for present purposes the inventors suggest that a digital sampling of the analog signal and key could be quite useful for performing such comparison and calculating the correlation coefficient, as explained below. It is noted that this analog signal generated from reading the data from mass storage medium 26 may be conveniently generated by devices in the prior art from the reading of either analog or digital data, it not being necessary that a digital key be used to match digital data as stored in mass storage medium 26. Alternatively, a correlation step 82 may be performed by matching the digital key with a stream of digital data as read from the mass storage medium 26. Note that the key reflects the inclusion of approximate information. Thus, correlating this with information read from the storage medium enables approximate matching capabilities.
[0037] Decision logic 84 would next make an intelligent decision as to whether a portion of data approximately matches or does not approximately match the key. Should a match be found, then the data is processed as at step 86 and the data requested by the query is sent to a disk cache 30, directly onto system bus 34, or otherwise be buffered or made available to a CPU 32, network interface 36, or otherwise as shown in FIGS. 1-4 . A logical step 88 is suggested in FIG. 5 for returning to the continuous reading of data from the mass storage medium 26, indicating perhaps a “do” loop. However, it should be understood that this is a continuous process and that data is processed from the mass storage medium 26 as a stream and not in individualized chunks, frames, bytes, or other predetermined portions of data. While this is not precluded, the present invention preferably allows a key to be in essence “slid” over a continuously varying data read signal such that there is no hesitation in reading data from the mass storage medium 26. There is no requirement to synchronize reading to the start or end of any multi-bit data structure, or any other intermediate steps required to be performed as the data is compared continuously “on the fly” as it is read from the mass storage medium 26. This type of comparison and correlation may be referred to as a pattern match or comparison. Eventually, the data access is completed as at step 90 and the process completed.
[0038] The inventors herein have preliminarily tested the present invention and have generated preliminary data demonstrating its operability and effectiveness.
[0039] FIG. 6 is a graphical representation of a measured analog signal output from a read/write head as the read/write head reads a magnetic medium on which is stored a 10-bit digital key. As shown therein, there are peaks in an analog signal which, as known in the art, represents the true analog signal generated by a read/write head as data is read from a magnetic medium such as a hard disk. The scales shown in FIG. 6 are volts along the vertical axis and tenths of microseconds along the horizontal axis.
[0040] As shown in FIG. 7 , an analog signal is generated, again by a read/write head, as data is read from a pseudo-random binary sequence stored in a test portion of a magnetic medium. As can be seen in FIG. 7 , the read signal does not provide an ideal square wave output when examined at this level.
[0041] FIG. 8 is a graphical representation, with the horizontal scale expanded, to more specifically illustrate the overlap between approximately two bits of the 8-bit key and the corresponding two bits found in the pseudo-random binary sequence encoded at a different location on the disk or magnetic medium.
[0042] FIG. 9 is a graphical representation of a correlation coefficient calculated continuously as the comparison is made between the key and the continuous reading of data from the hard disk. This correlation coefficient is calculated by sampling the analog signals at a high rate and using prior art signal processing correlation techniques. One such example may be found in Spatial Noise Phenomena of Longitudinal Magnetic Recording Media by Hoinville, Indeck and Muller, IEEE Transactions on Magnetics, Volume 28, no. 6, November 1992, the disclosure of which is incorporated herein by reference. A prior example of a reading, comparison, and coefficient calculation method and apparatus may be found in one or more of one of the co-inventor's prior patents such as U.S. Pat. No. 5,740,244, the disclosure of which is incorporated herein by reference. The foregoing represent examples of devices and methods which may be used to implement the present invention, however, as mentioned elsewhere herein, other similar devices and methods may be likewise used and the purposes of the invention fulfilled.
[0043] At approximately the point labeled 325, a distinct peak is noted which approaches 1, indicating a very close match between the key and the pseudo-random binary sequence. Thus, the present invention has been demonstrated as capable of finding a key that is present in a pseudo-random digital sequence. FIG. 9 is also illustrative of the opportunity for approximate matching which is believed to be a powerful aspect of the present invention. Looking closely at FIG. 9 , it is noted that there are other lesser peaks that appear in the correlation coefficient. Thus, if a threshold of 0.4 were established as a decision point, then not only the peak occurring which approaches 1 would indicate a match or “hit” but also another five peaks would be indicative of a “hit”. In this manner, a desired coefficient value may be predetermined or adjusted as desired to suit particular search parameters. For example, when searching for a particular word in a large body of text, lower correlation values may indicate the word is present but misspelled.
[0044] FIG. 10 depicts the continuous calculation of a correlation coefficient between the same 8-bit key but with a different data set. Again, a single match is picked up at approximately 200 microseconds. It is also noted that should a lower threshold be established additional hits would also be located in the pseudo-random data.
[0045] Various changes and modifications to the present invention would be apparent to those skilled in the art but yet which would not depart from the spirit of the invention. Several of these alternatives have been indicated above. For example, all of the operations exemplified by the analog processing shown in FIGS. 6-10 , have their equivalent counterparts in the digital domain. Thus, approximate matching and correlation types of processing can be done on the standard digital representation of the analog bit patterns. This can also be achieved in a continuous fashion using tailored digital logic, microprocessors and digital signal processors, or alternative combinations. It is therefore the inventors' intention that the present invention be limited solely by the scope of the claims appended hereto, and their legal equivalents.
Claims
What is claimed is:
1. A computer-implemented method for determining whether a DNA query sequence is an approximate match to a DNA sequence within a library of DNA sequences, the method comprising:
streaming the DNA sequences of the library through programmable logic that has been loaded with a key, wherein the key corresponds to a DNA query sequence; and
comparing the streaming DNA sequences with the key using the programmable logic to thereby identify any approximate matches that exist between the key and the streaming DNA sequences, wherein the comparing step comprises:
continuously computing a correlation coefficient between the key and a sliding window of the streaming DNA sequences using the programmable logic, and
judging each computed correlation coefficient against a threshold value to thereby identify an approximate match between the key and the streaming DNA sequences.
2. The method of claim 1 wherein the key comprises an analog key as represented by a plurality of samples, and wherein the streaming step comprises sampling an analog read signal of DNA sequences streaming from a database at a high rate, and wherein the comparing step comprises performing the comparing step on the respective samples of the analog key and the DNA sequences.
3. The method of claim 1 wherein the key comprises a digital key.
4. The method of claim 1 wherein the comparing step comprises determining whether any of the approximate matches exist based on an adjustable threshold using the programmable logic.
5. The method of claim 4 further comprising adjusting the threshold to control a degree of approximate matches which is identified as a result of the comparing step such that a forgivable number of residue mismatches may exist between the key and a window of the streaming DNA sequences while still qualifying as an approximate match.
6. A computer-implemented method for determining whether a DNA query sequence is an approximate match to a DNA sequence within a library of DNA sequences, the method comprising:
streaming the DNA sequences of the library through programmable logic that has been loaded with a key, wherein the key corresponds to a DNA query sequence;
comparing the streaming DNA sequences with the key using the programmable logic to thereby identify any approximate matches that exist between the key and the streaming DNA sequences based on an adjustable threshold; and
adjusting the threshold to control a degree of approximate matches which is identified as a result of the comparing step such that a forgivable number of residue mismatches may exist between the key and a window of the streaming DNA sequences while still qualifying as an approximate match.
7. The method of claim 6 wherein the comparing step comprises pattern comparing the streaming DNA sequences with the key using the programmable logic to thereby identify any approximate matches that exist between the key and the streaming DNA sequences.
8. The method of claim 7 wherein the pattern comparing step comprises pattern comparing the streaming DNA sequences with the key using the programmable logic without framing the streaming DNA sequences.
9. The method of claim 6 wherein the adjusting step comprises adjusting the threshold within the programmable logic.
10. The method of claim 6 wherein the key comprises an analog key as represented by a plurality of samples, and wherein the streaming step comprises sampling an analog read signal of DNA sequences streaming from a database at a high rate, and wherein the comparing step comprises performing the comparing step on the respective samples of the analog key and the DNA sequences.
11. The method of claim 6 wherein the key comprises a digital key.
12. The method of claim 6 further comprising:
receiving a search command from a processor that is in communication with the programmable logic; and
providing information to the processor that is indicative of any approximate matches identified as a result of the comparing step.
13. The method of claim 12 further comprising:
determining the key from the search command using the programmable logic.
14. An apparatus for determining whether a DNA query sequence is an approximate match to a DNA sequence that is stored by a mass storage medium as part of a library of DNA sequences, the apparatus comprising:
an approximate matching unit in communication with a mass storage medium, the approximate matching unit comprising programmable logic, the programmable logic being configured to (1) store a key, the key corresponding to a DNA query sequence, (2) receive a stream of DNA sequences from the mass storage medium, (3) continuously compute a correlation coefficient between the key and a sliding window of the received DNA sequences, and (4) judge the computed correlation coefficients against a threshold value to thereby identify whether any approximate matches exist between the key and the received DNA sequences.
15. The apparatus of claim 14 wherein the key comprises an analog key as represented by a plurality of samples, wherein the approximate matching unit is further configured to sample an analog read signal of DNA sequences streaming from the mass storage medium at a high rate, and wherein the programmable logic is further configured to perform its comparison on the respective samples of the analog key and the DNA sequences.
16. The apparatus of claim 14 wherein the key comprises a digital key.
17. An apparatus for determining whether a DNA query sequence is an approximate match to a DNA sequence that is stored by a mass storage medium as part of a library of DNA sequences, the apparatus comprising:
an approximate matching unit in communication with a mass storage medium, the approximate matching unit comprising programmable logic, the programmable logic having a key loaded thereon, wherein the key corresponds to a DNA query sequence, the approximate matching unit being configured to (1) stream the DNA sequences of the library through the programmable logic, (2) compare the streaming DNA sequences with the key using the programmable logic to thereby identify any approximate matches that exist between the key and the streaming DNA sequences based on an adjustable threshold, and (3) adjust the threshold to control a degree of approximate matches which is identified as a result of the comparison operation such that a forgivable number of residue mismatches may exist between the key and a window of the streaming DNA sequences while still qualifying as an approximate match.
18. The apparatus of claim 17 further comprising the mass storage medium directly coupled to the approximate matching unit.
19. The apparatus of claim 18 wherein the mass storage medium comprises a hard disk drive.
20. The apparatus of claim 18 wherein the mass storage medium comprises a bank of hard disk drives.
21. The apparatus of claim 17 wherein the apparatus further comprises a processor and a system bus, the system bus interconnecting the processor with the approximate matching unit, wherein the approximate matching unit is further configured to (1) receive a search command from the processor via the system bus, and (2) provide information to the processor that is indicative of any approximate matches identified as a result of the comparison.
22. The apparatus of claim 21 wherein the programmable logic is further configured to determine the key from the search command.
23. The apparatus of claim 17 wherein the apparatus further comprises a network interface and a system bus, the system bus interconnecting the network interface with the approximate matching unit, wherein the approximate matching unit is further configured to (1) receive a search command from the network interface via the system bus, and (2) provide information to the network interface that is indicative of any approximate matches identified as a result of the comparison.
24. The apparatus of claim 17 wherein the key comprises a digital key.
Patent Citations (228)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3601808(A) | 1971-08-01 | Vlack | Applicant |
| US3611314(A) | 1971-10-01 | Pritchard, Jr. et al. | Applicant |
| US3729712(A) | 1973-04-01 | Glassman | Applicant |
| US3824375(A) | 1974-07-01 | Gross et al. | Applicant |
| US3848235(A) | 1974-11-01 | Lewis et al. | Applicant |
| US3906455(A) | 1975-09-01 | Houston et al. | Applicant |
| US4081607(A) | 1978-03-01 | Vitols et al. | Applicant |
| US4298898(A) | 1981-11-01 | Cardot | Applicant |
| US4314356(A) | 1982-02-01 | Scarbrough | Applicant |
| US4385393(A) | 1983-05-01 | Chaure et al. | Applicant |
| US4464718(A) | 1984-08-01 | Dixon et al. | Applicant |
| US4550436(A) | 1985-10-01 | Freeman et al. | Applicant |
| US4823306(A) | 1989-04-01 | Barbic et al. | Applicant |
| US4941178(A) | 1990-07-01 | Chuang | Applicant |
| US5023910(A) | 1991-06-01 | Thomson | Applicant |
| US5050075(A) | 1991-09-01 | Herman et al. | Applicant |
| US5077665(A) | 1991-12-01 | Silverman et al. | Applicant |
| US5101424(A) | 1992-03-01 | Clayton et al. | Applicant |
| US5140692(A) | 1992-08-01 | Morita et al. | Applicant |
| US5163131(A) | 1992-11-01 | Row et al. | Applicant |
| US5179626(A) | 1993-01-01 | Thomson | Applicant |
| US5226165(A) | 1993-07-01 | Martin et al. | Applicant |
| US5243655(A) | 1993-09-01 | Wang | Applicant |
| US5249292(A) | 1993-09-01 | Chiappa | Applicant |
| US5255136(A) | 1993-10-01 | Machado et al. | Applicant |
| US5265065(A) | 1993-11-01 | Turtle | Applicant |
| US5319776(A) | 1994-06-01 | Hile et al. | Applicant |
| US5327521(A) | 1994-07-01 | Savic et al. | Applicant |
| US5339411(A) | 1994-08-01 | Heaton, Jr. | Applicant |
| US5347634(A) | 1994-09-01 | Herrell et al. | Applicant |
| US5371794(A) | 1994-12-01 | Diffie et al. | Applicant |
| US5388259(A) | 1995-02-01 | Fleischman et al. | Applicant |
| US5396253(A) | 1995-03-01 | Chia et al. | Applicant |
| US5418951(A) | 1995-05-01 | Damashek | Applicant |
| US5421028(A) | 1995-05-01 | Swanson | Applicant |
| US5432822(A) | 1995-07-01 | Kaewell, Jr. | Applicant |
| US5440723(A) | 1995-08-01 | Arnold et al. | Applicant |
| US5461712(A) | 1995-10-01 | Chelstowski et al. | Applicant |
| US5465353(A) | 1995-11-01 | Hull et al. | Applicant |
| US5481735(A) | 1996-01-01 | Mortensen et al. | Applicant |
| US5488725(A) | 1996-01-01 | Turtle et al. | Applicant |
| US5497488(A) | 1996-03-01 | Akizawa et al. | Applicant |
| US5544352(A) | 1996-08-01 | Egger | Applicant |
| US5546578(A) | 1996-08-01 | Takada et al. | Applicant |
| US5651125(A) | 1997-07-01 | Witt et al. | Applicant |
| US5701464(A) | 1997-12-01 | Aucsmith | Applicant |
| US5721898(A) | 1998-02-01 | Beardsley et al. | Applicant |
| US5740244(A) | 1998-04-01 | Indeck et al. | Applicant |
| US5740466(A) | 1998-04-01 | Geldman et al. | Applicant |
| US5774835(A) | 1998-06-01 | Ozawa et al. | Applicant |
| US5774839(A) | 1998-06-01 | Shlomot | Applicant |
| US5781772(A) | 1998-07-01 | Wilkinson, III et al. | Applicant |
| US5781921(A) | 1998-07-01 | Nichols | Applicant |
| US5805832(A) | 1998-09-01 | Brown et al. | Applicant |
| US5813000(A) | 1998-09-01 | Furlani | Applicant |
| US5819273(A) | 1998-10-01 | Vora et al. | Applicant |
| US5819290(A) | 1998-10-01 | Fujita et al. | Applicant |
| US5826075(A) | 1998-10-01 | Bealkowski et al. | Applicant |
| US5864738(A) | 1999-01-01 | Kessler et al. | Applicant |
| US5870730(A) | 1999-02-01 | Furuya et al. | Applicant |
| US5884286(A) | 1999-03-01 | Daughtery, III | Applicant |
| US5913211(A) | 1999-06-01 | Nitta et al. | Applicant |
| US5930753(A) | 1999-07-01 | Potamianos et al. | Applicant |
| US5943421(A) | 1999-08-01 | Grabon | Applicant |
| US5943429(A) | 1999-08-01 | Handel et al. | Applicant |
| US5978801(A) | 1999-11-01 | Yuasa | Applicant |
| US5991881(A) | 1999-11-01 | Conklin et al. | Applicant |
| US5995963(A) | 1999-11-01 | Nanba et al. | Applicant |
| US6023760(A) | 2000-02-01 | Karttunen et al. | Applicant |
| US6028939(A) | 2000-02-01 | Yin | Applicant |
| US6044407(A) | 2000-03-01 | Jones et al. | Applicant |
| US6061662(A) | 2000-05-01 | Makivic | Applicant |
| US6067569(A) | 2000-05-01 | Khaki et al. | Applicant |
| US6070172(A) | 2000-05-01 | Lowe | Applicant |
| US6073160(A) | 2000-06-01 | Grantham et al. | Applicant |
| US6105067(A) | 2000-08-01 | Batra | Applicant |
| US6134551(A) | 2000-10-01 | Aucsmith | Applicant |
| US6138176(A) | 2000-10-01 | McDonald et al. | Applicant |
| USRE36946(E) | 2000-11-01 | Diffie et al. | Applicant |
| US6147976(A) | 2000-11-01 | Shand et al. | Applicant |
| US6169969(B1) | 2001-01-01 | Cohen | Applicant |
| US6173276(B1) | 2001-01-01 | Kant et al. | Applicant |
| US6175874(B1) | 2001-01-01 | Imai et al. | Applicant |
| US6226676(B1) | 2001-05-01 | Crump et al. | Applicant |
| US6263321(B1) | 2001-07-01 | Daughtery, III | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6317795(B1) | 2001-11-01 | Malkin et al. | Applicant |
| US6336150(B1) | 2002-01-01 | Ellis et al. | Applicant |
| US6370645(B1) | 2002-04-01 | Lee et al. | Applicant |
| US6377942(B1) | 2002-04-01 | Hinsley et al. | Applicant |
| US6389532(B1) | 2002-05-01 | Gupta et al. | Applicant |
| US6397259(B1) | 2002-05-01 | Lincke et al. | Applicant |
| US6397335(B1) | 2002-05-01 | Franczek et al. | Applicant |
| US6412000(B1) | 2002-06-01 | Riddle et al. | Applicant |
| US6418419(B1) | 2002-07-01 | Nieboer et al. | Applicant |
| US6430272(B1) | 2002-08-01 | Maruyama et al. | Applicant |
| US6456982(B1) | 2002-09-01 | Pilipovic | Applicant |
| US6463474(B1) | 2002-10-01 | Fuh et al. | Applicant |
| US6499107(B1) | 2002-12-01 | Gleichauf et al. | Applicant |
| US6546375(B1) | 2003-04-01 | Pang et al. | Applicant |
| US6564263(B1) | 2003-05-01 | Bergman et al. | Applicant |
| US6578147(B1) | 2003-06-01 | Shanklin et al. | Applicant |
| US6704816(B1) | 2004-03-01 | Burke | Applicant |
| US6711558(B1) | 2004-03-01 | Indeck et al. | Applicant |
| US6765918(B1) | 2004-07-01 | Dixon et al. | Applicant |
| US6772136(B2) | 2004-08-01 | Kant et al. | Applicant |
| US6772345(B1) | 2004-08-01 | Shetty | Applicant |
| US6778968(B1) | 2004-08-01 | Gulati | Applicant |
| US6804667(B1) | 2004-10-01 | Martin | Applicant |
| US6807156(B1) | 2004-10-01 | Veres et al. | Applicant |
| US6850906(B1) | 2005-02-01 | Chadha et al. | Applicant |
| US6870837(B2) | 2005-03-01 | Ho et al. | Applicant |
| US6877044(B2) | 2005-04-01 | Lo et al. | Applicant |
| US6886103(B1) | 2005-04-01 | Brustoloni et al. | Applicant |
| US6901461(B2) | 2005-05-01 | Bennett | Applicant |
| US6944168(B2) | 2005-09-01 | Paatela et al. | Applicant |
| US6978223(B2) | 2005-12-01 | Milliken | Applicant |
| US6981054(B1) | 2005-12-01 | Krishna | Applicant |
| US7024384(B2) | 2006-04-01 | Daughtery, III | Applicant |
| US7093023(B2) | 2006-08-01 | Lockwood et al. | Applicant |
| US7103569(B1) | 2006-09-01 | Groveman et al. | Applicant |
| US7139743(B2) | 2006-11-01 | Indeck et al. | Applicant |
| US7167980(B2) | 2007-01-01 | Chiu | Applicant |
| US7181437(B2) | 2007-02-01 | Indeck et al. | Applicant |
| US7181608(B2) | 2007-02-01 | Fallon et al. | Applicant |
| US7225188(B1) | 2007-05-01 | Gai et al. | Applicant |
| US7251629(B1) | 2007-07-01 | Marynowski et al. | Applicant |
| US7286564(B2) | 2007-10-01 | Roberts | Applicant |
| US7444515(B2) | 2008-10-01 | Dharmapurikar et al. | Applicant |
| US7565525(B2) | 2009-07-01 | Vorbach et al. | Applicant |
| US2001/0052038(A1) | 2001-12-01 | Fallon et al. | Applicant |
| US2001/0056547(A1) | 2001-12-01 | Dixon | Applicant |
| US2002/0031125(A1) | 2002-03-01 | Sato | Applicant |
| US2002/0082967(A1) | 2002-06-01 | Kaminsky et al. | Applicant |
| US2002/0105911(A1) | 2002-08-01 | Pruthi et al. | Applicant |
| US2002/0129140(A1) | 2002-09-01 | Peled et al. | Applicant |
| US2002/0162025(A1) | 2002-10-01 | Sutton et al. | Applicant |
| US2002/0166063(A1) | 2002-11-01 | Lachman et al. | Applicant |
| US2003/0009693(A1) | 2003-01-01 | Brock et al. | Applicant |
| US2003/0014662(A1) | 2003-01-01 | Gupta et al. | Applicant |
| US2003/0023876(A1) | 2003-01-01 | Bardsley et al. | Applicant |
| US2003/0043805(A1) | 2003-03-01 | Graham et al. | Applicant |
| US2003/0051043(A1) | 2003-03-01 | Wyschogrod et al. | Applicant |
| US2003/0055658(A1) | 2003-03-01 | RuDusky | Applicant |
| US2003/0055770(A1) | 2003-03-01 | RuDusky | Applicant |
| US2003/0055771(A1) | 2003-03-01 | RuDusky | Applicant |
| US2003/0065943(A1) | 2003-04-01 | Geis et al. | Applicant |
| US2003/0074582(A1) | 2003-04-01 | Patel et al. | Applicant |
| US2003/0093347(A1) | 2003-05-01 | Gray | Applicant |
| US2003/0110229(A1) | 2003-06-01 | Kulig et al. | Applicant |
| US2003/0126065(A1) | 2003-07-01 | Eng et al. | Applicant |
| US2003/0177253(A1) | 2003-09-01 | Schuehler et al. | Applicant |
| US2003/0221013(A1) | 2003-11-01 | Lockwood et al. | Applicant |
| US2004/0028047(A1) | 2004-02-01 | Hou et al. | Applicant |
| US2004/0034587(A1) | 2004-02-01 | Amberson et al. | Applicant |
| US2004/0049596(A1) | 2004-03-01 | Schuehler et al. | Applicant |
| US2004/0177340(A1) | 2004-09-01 | Hsu et al. | Applicant |
| US2004/0186804(A1) | 2004-09-01 | Chakraborty et al. | Applicant |
| US2004/0186814(A1) | 2004-09-01 | Chalermkraivuth et al. | Applicant |
| US2004/0199448(A1) | 2004-10-01 | Chalermkraivuth et al. | Applicant |
| US2004/0205149(A1) | 2004-10-01 | Dillon et al. | Applicant |
| US2005/0033672(A1) | 2005-02-01 | Lasry et al. | Applicant |
| US2005/0086520(A1) | 2005-04-01 | Dharmapurikar et al. | Applicant |
| US2005/0091142(A1) | 2005-04-01 | Renton et al. | Applicant |
| US2005/0131790(A1) | 2005-06-01 | Benzschawel et al. | Applicant |
| US2005/0187844(A1) | 2005-08-01 | Chalermkraivuth et al. | Applicant |
| US2005/0187845(A1) | 2005-08-01 | Eklund et al. | Applicant |
| US2005/0187846(A1) | 2005-08-01 | Subbu et al. | Applicant |
| US2005/0187847(A1) | 2005-08-01 | Bonissone et al. | Applicant |
| US2005/0187848(A1) | 2005-08-01 | Bonissone et al. | Applicant |
| US2005/0187849(A1) | 2005-08-01 | Bollapragada et al. | Applicant |
| US2005/0195832(A1) | 2005-09-01 | Dharmapurikar et al. | Applicant |
| US2005/0197938(A1) | 2005-09-01 | Davie et al. | Applicant |
| US2005/0197939(A1) | 2005-09-01 | Davie et al. | Applicant |
| US2005/0197948(A1) | 2005-09-01 | Davie et al. | Applicant |
| US2005/0216384(A1) | 2005-09-01 | Partlow et al. | Applicant |
| US2005/0267836(A1) | 2005-12-01 | Crosthwaite et al. | Applicant |
| US2005/0283423(A1) | 2005-12-01 | Moser et al. | Applicant |
| US2006/0020536(A1) | 2006-01-01 | Renton et al. | Applicant |
| US2006/0031154(A1) | 2006-02-01 | Noviello et al. | Applicant |
| US2006/0031156(A1) | 2006-02-01 | Noviello et al. | Applicant |
| US2006/0053295(A1) | 2006-03-01 | Madhusudan et al. | Applicant |
| US2006/0059064(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059065(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059066(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059067(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059068(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059069(A1) | 2006-03-01 | Glinberg et al. | Applicant |
| US2006/0059083(A1) | 2006-03-01 | Friesen et al. | Applicant |
| US2006/0143099(A1) | 2006-06-01 | Partlow et al. | Applicant |
| US2006/0259417(A1) | 2006-11-01 | Marynowski et al. | Applicant |
| US2006/0294059(A1) | 2006-12-01 | Chamberlain et al. | Applicant |
| US2007/0067108(A1) | 2007-03-01 | Buhler et al. | Applicant |
| US2007/0078837(A1) | 2007-04-01 | Indeck et al. | Applicant |
| US2007/0118500(A1) | 2007-05-01 | Indeck et al. | Applicant |
| US2007/0130140(A1) | 2007-06-01 | Cytron et al. | Applicant |
| US2007/0174841(A1) | 2007-07-01 | Chamberlain et al. | Applicant |
| US2007/0277036(A1) | 2007-11-01 | Chamberlain et al. | Applicant |
| US2008/0086274(A1) | 2008-04-01 | Chamberlain et al. | Applicant |
| US2008/0109413(A1) | 2008-05-01 | Indeck et al. | Applicant |
| US2008/0114760(A1) | 2008-05-01 | Indeck et al. | Applicant |
| US2008/0126320(A1) | 2008-05-01 | Indeck et al. | Applicant |
| US2008/0133453(A1) | 2008-06-01 | Indeck et al. | Applicant |
| US2008/0133519(A1) | 2008-06-01 | Indeck et al. | Applicant |
| EP851358(A) | 1998-07-01 | Applicant | |
| EP880088 | 1998-11-01 | Applicant | |
| EP887723 | 1998-12-01 | Applicant | |
| EP911738(A) | 1999-04-01 | Applicant | |
| JP9-269930 | 1997-10-01 | Applicant | |
| JP10-313341 | 1998-11-01 | Applicant | |
| WO9905814 | 1999-02-01 | Applicant | |
| WO9955052 | 1999-10-01 | Applicant | |
| WO122425(A) | 2001-03-01 | Applicant | |
| WO139577 | 2001-06-01 | Applicant | |
| WO161913 | 2001-08-01 | Applicant | |
| WO180082(A2) | 2001-10-01 | Applicant | |
| WO180558 | 2001-10-01 | Applicant | |
| WO2061525 | 2002-08-01 | Applicant | |
| WO3100650 | 2003-04-01 | Applicant | |
| WO3036845 | 2003-05-01 | Applicant | |
| WO3100662 | 2003-12-01 | Applicant | |
| WO2004017604 | 2004-02-01 | Applicant | |
| WO2005017708 | 2005-02-01 | Applicant | |
| WO2005026925 | 2005-03-01 | Applicant | |
| WO2005048134(A) | 2005-05-01 | Applicant | |
| WO2006023948 | 2006-03-01 | Applicant | |
| WO2006096324 | 2006-09-01 | Applicant | |
| WO2008022036 | 2008-02-01 | Applicant |
Non-Patent Literature (104)
- Guerdoux-Jamet et al., Systolic filter for Fast DNA Similarity Search, 1995, IEEE, 145-156.Examiner
- Ramesh et al., Automatic selection of tuning parameters for feature extraction sequences, Jun. 21-23, 1994, IEEE, 672-677.Examiner
- Mariusz Niewczas et al., A pattern matching algorithm for verification and analysis of very large IC layouts, Apr. 1998, ACM, 129-143.Examiner
- Altschul et al., “Basic Local Alignment Search Tool”, J. Mol. Biol., Oct. 5, 1990, 215, pp. 403-410.Applicant
- Cavnar and Trenkle, “N-Gram-Based Text Categorization”, Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, pp. 161-175, 1994.Applicant
- Forgy, “Rete: A fast algorithm for the many pattern/many object pattern matching problem”, Artificial Intelligence, 19, pp. 17-37, 1982.Applicant
- Hoinville, et al. “Spatial Noise Phenomena of Longitudinal Magnetic Recording Media”, IEEE Transactions on Magnetics, vol. 28, No. 6, Nov. 1992.Applicant
- Jeanmougin et al., “Multiple Sequence Alignment with Clustal X”, TIBS, 1998, vol. 23, pp. 403-405.Applicant
- Jones et al., “A Probabilistic Model of Information Retrieval: Development and Status”, Information Processing and Management, Aug. 1998, 76 pages.Applicant
- Jung et al., “Efficient VLSI for Lempel-Ziv Compression in Wireless Data Communication Networks”, IEEE Transactions on VLSI Systems, Sep. 1998, pp. 475-483, vol. 6, No. 3, Institute of Electrical and Electronics Engineers, Washington, DC, USA.Applicant
- Pirsch et al., “VLSI Architectures for Video Compression-A Survey”, Proceedings of the IEEE, Feb. 1995, pp. 220-243, vol. 83, No. 2, Institute of Electrical and Electronics Engineers, Washington, DC, USA.Applicant
- Ramakrishna et al., “Efficient Hardware Hashing Functions for High Performance Computers”, IEEE Transactions on Computers, Dec. 1997, vol. 46, No. 12.Applicant
- Ranganathan et al., “High-Speed VLSI Designs for Lempe-Ziv Based Data Compression”, IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, Feb. 1993, pp. 96-106, vol. 40, No. 2, Institute of Electrical and Electronics Engineers, Washington, DC, USA.Applicant
- Ratha et al., “FPGA-based coprocessor for text string extraction”, IEEE, Sep. 11-13, 2000, pp. 217-221.Applicant
- Roesch, “Snort—Lightweight Intrusion Detection for Networks”, Proceedings of LISA '99: 13th Systems Administration Conference; Nov. 7-12, 1999; pp. 229-238; USENIX Association, Seattle, WA USA.Applicant
- Roy, “A bounded search algorithm for segmented channel routing for FPGA's and associated channel architecture issues”, IEEE, Nov. 11, 1993, pp. 1695-1705, vol. 12.Applicant
- Thompson et al., “The CLUSTAL—X Windows Interface: Flexible Strategies for Multiple Sequence Alignment Aided by Quality Analysis Tools”, Nucleic Acids Research, 1997, vol. 25, No. 24, pp. 4876-4882.Applicant
- Shah, N., “Understanding Network Processors”, Version 1.0, University of California-Berkeley, Sep. 4, 2001.Applicant
- Shirazi et al.; “Quantitative Analysis of FPGA-based Database Searching”; Journal of VLSI Signal Processing Systems For Signal, Image, and Video Technology; May 2001; pp. 85-96; vol. 28, No. 1/2; Kluwer Academic Publishers; Dordrecht, NL.Applicant
- Sidhu et al., “Fast Regular Expression Matching using FPGAs”, IEEE Symposium on Field Programmable Custom Computing Machines (FCCM 2001), Apr. 2001.Applicant
- Sidhu et al., “String Matching on Multicontext FPGAs using Self-Reconfiguration”, FPGA '99: Proceedings of the 1999 ACM/SIGDA 7th International Symposium on Field Programmable Gate Arrays, Feb. 1999, pp. 217-226.Applicant
- Taylor and Turner., “Scalable Packet Classification using Distributed Crossproducting of Field Labels”, Proceedings of IEEE Infocom vol. 20, No. 1, Mar. 2005, pp. 1-12.Applicant
- Taylor et al., “Generalized RAD Module Interface Specification of the Field Programmable Port Extender (FPX) Version 2”, Washington University, Department of Computer Science, Technical Report, Jan. 8, 2000.Applicant
- Taylor et al., “Modular Design Techniques for the FPX”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Taylor, “Models, Algorithms, and Architectures for Scalable Packet Classification”, doctoral thesis, Department of Computer Science and Engineering, Washington University, St. Louis, MO Aug. 2004, pp. 1-201.Applicant
- Ting-Pang Lin et al.; “Real-Time Image Template Matching Based on Systolic Array Processor”; International Journal of Electronics; Dec. 1, 1992; pp. 1165-1176; vol. 73, No. 6; London, Great Britain.Applicant
- Villasenor et al.; “Configurable Computing Solutions For Automatic Target Recognition”; FPGAS for Custom Computing Machines, 1996, Proceedings, IEEE Symposium on Napa Valley, CA; Apr. 17-19, 1996; pp. 70-79; 1996 IEEE; Napa Valley, CA, Los Alamitos, CA, USA.Applicant
- Yamaguchi et al.; “High Speed Homology Search with FPGAs”; Proceedings Pacific Symposium on Biocomputing; Jan. 3-7, 2002; pp. 271-282; vol. 7; Online; Lihue, Hawaii, USA.Applicant
- “RFC793: Transmission Control Protocol, Darpa Internet Program, Protocol Specification”, Sep. 1981.Applicant
- Anerousis et al., “Using the AT&T Labs PacketScope for Internet Measurement, Design, and Performance Analysis”, Network and Distributed Systems Research Laboratory, AT&T Labs-Research, Florham, Park, NJ, Oct. 1997.Applicant
- Artan et al., “Multi-packet Signature Detection using Prefix Bloom Filters”, 2005, IEEE, pp. 1811-1816.Applicant
- Bloom, “Space/Time Trade-offs in Hash Coding With Allowable Errors”, Communications of the ACM, Jul. 1970, pp. 422-426, vol. 13, No. 7, Computer Usage Company, Newton Upper Falls, Massachusetts, USA.Applicant
- Cuppu and Jacob, “Organization Design Trade-Offs at the DRAM, Memory Bus and Memory Controller Level: Initial Results,” Technical Report UMB-SCA-1999-2, Univ. of Maryland Systems & Computer Architecture Group, Nov. 1999, pp. 1-10.Applicant
- Dharmapurikar et al., “Deep Packet Inspection Using Parallel Bloom Filters,” Symposium on High Performance Interconnects (Hotl), Stanford, California, 2003, pp. 44-51.Applicant
- Dharmapurikar et al., “Longest Prefix Matching Using Bloom Filters,” SIGCOMM, 2003, pp. 201-212.Applicant
- Dharmapurikar et al., “Robust TCP Stream Reassembly in the Presence of Adversaries”, Proc. of the 14th Conference on USENIX Security Symposium—vol. 14, 16 pages, Baltimore, MD, 2005; http://www.icir.org/vern/papers/TcpReassembly/TCPReassembly.pdf.Applicant
- International Search Report for PCT/US2002/033286; Jan. 22, 2003.Applicant
- International Search Report for PCT/US2005/030046; Sep. 25, 2006.Applicant
- Jacobson et al., “RFC 1072: TCP Extensions for Long-Delay Paths”, Oct. 1988.Applicant
- Madhusudan, “Design of a System for Real-Time Worm Detection”, Hot Interconnects, pp. 77-83, Stanford, CA, Aug. 2004, found at http://www.hoti.org/hoti12/program/papers/2004/paper4.2.pdf.Applicant
- Madhusudan, “Design of a System for Real-Time Worm Detection”, Master's Thesis, Washington Univ., Dept. of Computer Science and Engineering, St. Louis, MO, Aug. 2004.Applicant
- Madhusudan, “Design of a System for Real-Time Worm Detection”, Power Point Presentation in Support of Master's Thesis, Washington Univ., Dept. of Computer Science and Engineering, St. Louis, MO, Aug. 2004.Applicant
- Mao et al., “Cluster-based Online Monitoring System of Web Traffic”, Dept. of Computer Science and Technology, Tsinghua Univ., Bejing, 100084 P.R. China.Applicant
- Moscola et al., “FPSed: A Streaming Content Search-And-Replace Module for an Internet Firewall”, Proc. of Hot Interconnects, 11th Symposium on High Performance Interconnects, pp. 122-129, Aug. 20, 2003.Applicant
- Moscola, “FPGrep and FPSed: Packet Payload Processors for Managing the Flow of Digital Content on Local Area Networks and the Internet”, Master's Thesis, Sever Institute of Technology, Washington University, St. Louis, MO, Aug. 2003.Applicant
- Schuehler et al., “Architecture for a Hardware Based, TCP/IP Content Scanning System”, IEEE Micro, 24(1):62-69, Jan.-Feb. 2004, USA.Applicant
- Schuehler et al., “TCP-Splitter: A TCP/IP Flow Monitor in Reconfigurable Hardware”, Hot Interconnects 10 (Hotl-10), Stanford, CA, Aug. 21-23, 2002, pp. 127-131.Applicant
- Singh et al., “The EarlyBird System for Real-Time Detection on Unknown Worms”, Technical report CS2003-0761, Aug. 2003.Applicant
- Taylor et al., “Dynamic Hardware Plugins (DHP): Exploiting Reconfigurable Hardware for High-Performance Programmable Routers”, Computer Networks, 38(3): 295-310 (16), Feb. 21, 2002, and online at http://www.cc.gatech.edu/classes/AY2007/cs8803hpc—fall/papers/phplugins.pdf.Applicant
- Weaver et al., “Very Fast Containment of Scanning Worms”, Proc. USENIX Security Symposium 2004, San Diego, CA, Aug. 2004, located at http://www.icsi.berkely.edu/˜nweaver/containment/containment.pdf.Applicant
- Wooster et al., “HTTPDUMP Network HTTP Packet Snooper”, Apr. 25, 1996.Applicant
- Yan et al., “Enhancing Collaborative Spam Detection with Bloom Filters”, 2006, IEEE, pp. 414-425.Applicant
- “Lucent Technologies Delivers “Payload Plus” Network Processors for Programmable, Multi-Protocol, OC-48c Processing”, Lucent Technologies Press Release, downloaded from http://www.lucent.com/press/1000/0010320.meb.html on Mar. 21, 2002.Applicant
- “Overview, Field Programmable Port Extender”, Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- “Payload Plus TM Agere System Interface”, Agere Systems Product Brief, Jun. 2001, downloaded from internet, Jan. 2002.Applicant
- “The Field-Programmable Port Extender (FPX)”, downloaded from http://www.arl.wustl.edu/arl/ in Mar. 2002.Applicant
- Anonymous; “Method for Allocating Computer Disk Space to a File of Known Size”, IBM Technical Disclosure Bulletin, vol. 27, No. 10B, Mar. 1, 1985, New York.Applicant
- Arnold et al.; “The Splash 2 Processor and Applications”; Proceedings 1993 IEEE International Conference on Computer Design: VLSI In Computers and Processors (ICCD '93); Oct. 3, 1993; pp. 482-485; IEEE Computer Society; Cambridge, MA USA.Applicant
- Baer, Jean-Loup; “Computer Systems Architecture”; 1980; pp. 262-265; Computer Science Press; Potomac, Maryland.Applicant
- Baeza-yates and Navarro, “New and Faster Filters for Multiple Approximate String Matching”, Random Structures and Algorithms (RSA) vol. 20, No. 1, Jan. 2002, pp. 23-49.Applicant
- Berk, Elliott, “JLex: A lexical analyzer generator for JavaTM”, downloaded from http://www.cs.princeton.edu/˜appel/modern/java/Jlex/ in Jan. 2002 pp. 1-18.Applicant
- Braun et al., “Layered Protocol Wrappers for Internet Packet Processing in Reconfigurable Hardware”, Proceedings of Hot Interconnects 9 (Hotl-9) Stanford, CA, Aug. 22-24, 2001, pp. 93-98.Applicant
- Choi et al., “Design of a Flexible Open Platform for High Performance Active Networks”, Allerton Conference, Champaign, II, 1999.Applicant
- Cloutier et al.; “VIP: An FPGA-Based Processor for Image Processing and Neural Networks”; Proceedings of Fifth International Conference on Microelectronics for Neural Networks: Feb. 12, 1996; pp. 330-336; Los Alamitos, California.Applicant
- Compton et al.; “Configurable Computing: A Survey of Systems and Software”; Technical Report, Northwestern University, Dept. of ECE, 1999.Applicant
- Cong et al., An Optional Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs, IEEE, 1992, 48-53.Applicant
- Ebeling et al. “RaPiD—Reconfigurable Pipelined Datapath”, University of Washington, Dept. of Computer Science and Engineering, Sep. 23, 1996; Seattle, WA.Applicant
- Franklin et al., “Assisting Network Intrusion Detection with Reconfigurable Hardware”, Symposium on Field-Programmable Custom Computing Machines (FCCM 2002), Apr. 2002, Napa, California.Applicant
- Fu et al., “The FPX KCPSM Module: An Embedded, Reconfigurable Active Processing Module for the Field Programmable Port Extender (FPX)”, Washington University, Department of Computer Science, Technical Report WUCS-01-14, Jul. 2001.Applicant
- Gavrila et al., “Multi-feature Hierarchical Template Matching Using Distance Transforms”, IEEE, Aug. 16-20, 1998, vol. 1, pp. 439-444.Applicant
- Gunther et al., “Assessing Document Relevance with Run-Time Reconfigurable Machines”, FPGAs for Custom Computing Machines, 1996, Proceedings, IEEE Symposium on Napa Valley, CA, Apr. 17, 1996.Applicant
- Hauck et al., “Software Technologies for Reconfigurable Systems”, Northwestern University, Dept. of ECE, Technical Report, 1996.Applicant
- Hayes, “Computer Architecture and Organization”, Second Edition, 1988, pp. 448-459, McGraw-Hill, Inc.Applicant
- Hezel et al., “FPGA-Based Template Matching Using Distance Transforms”, Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 22, 2002, pp. 89-97; IEEE Computer Society, USA.Applicant
- Hollaar, “Hardware Systems for Text Information Retrieval”, Proceedings of the Sixth Annual International ACM Sigir Conference on Research and Development in Information Retrieval, Jun. 6-8, 1983, pp. 3-9; Baltimore, Maryland, USA.Applicant
- International Search Report for PCT/US2001/011255; Jul. 10, 2003.Applicant
- International Search Report for PCT/US2003/015638; May 6, 2004.Applicant
- International Search Report for PCT/US2004/016398; Apr. 12, 2005.Applicant
- Lockwood et al., “Field Programmable Port Extender (FPX) for Distributed Routing and Queuing”, ACM International Symposium on Field Programmable Gate Arrays (FPGA 2000), Monterey, CA, Feb. 2000, pp. 137-144.Applicant
- Lockwood et al., “Hello, World: A Simple Application for the Field Programmable Port Extender (FPX)”, Washington University, Department of Computer Science, Technical Report WUCS-00-12, Jul. 11, 2000.Applicant
- Lockwood et al., “Parallel FPGA Programming over Backplane Chassis”, Washington University, Department of Computer Science, Technical Report WUCS-00-11, Jun. 12, 2000.Applicant
- Lockwood et al., “Reprogrammable Network Packet Processing on the Field Programmable Port Extender (FPX)”, ACM International Symposium on Field Programmable Gate Arrays (FPGA 2001), Monterey, CA, Feb. 2001, pp. 87-93.Applicant
- Lockwood, J., “An Opent Platform for Development of Network Processing Modules in Reprogrammable Hardware”, IEC DesignCon 2001, Santa Clara, CA, Jan. 2001, Paper WB-19.Applicant
- Lockwood, J., “Building Networks with Reprogrammable Hardware”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Lockwood, J., “Evolvable Internet Hardware Platforms”, NASA/DoD Workshop on Evolvable Hardware (EHW'01), Long Beach, CA, Jul. 12-14, 2001, pp. 271-279.Applicant
- Lockwood, J., “Hardware Laboratory Configuration”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Lockwood J., “Introduction”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Lockwood, J., “Platform and Methodology for Teaching Design of Hardware Modules in Internet Routers and Firewalls”, IEEE Computer Society International Conference on Microelectronic Systems Education (MSE'2001), Las Vegas, NV, Jun. 17-18, 2001, pp. 56-57.Applicant
- Lockwood, J., “Protocol Processing on the FPX”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Lockwood, J., “Simulation and Synthesis”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002.Applicant
- Lockwood, J., “Simulation of the Hello World Application for the Field-Programmable Port Extender (FPX)”, Washington University, Applied Research Lab, Spring 2001 Gigabits Kits Workshop.Applicant
- Mosanya et al.; “A FPGA-Based Hardware Implementation of Generalized Profile Search Using Online Arithmetic”; ACM/Sigda International Symposium on Field Programmable Gate Arrays (FPGA '99): Feb. 21-23, 1999; pp. 101-111; Monterey, CA, USA.Applicant
- Navarro, “A Guided Tour to Approximate String Matching”, ACM Computing Surveys, vol. 33, No. 1, Mar. 2001, pp. 31-88.Applicant
- Nunez et al.; “The X-MatchLITE FPGA-Based Data Compressor”, Euromicro Conference 1999, Proceedings, Italy, Sep. 8-10, 1999, Los Alamitos, CA.Applicant
- Partial International Search Report for PCT/US 03/15638 dated Feb. 3, 2004.Applicant
- Pramanik et al.; “A Hardware Pattern Matching Algorithm on a Dataflow”; Computer Journal; Jul. 1, 1985; pp. 264-269; vol. 28, No. 3; Oxford University Press, Surrey, Great Britain.Applicant
- Ramakrishna et al., “A Performance Study of Hashing Functions for Hardware Applications”, Journal of Computing and Information, vol. 1, No. 1, May 1994, pp. 1621-1636.Applicant
- Ratha et al.; “Convolution on Splash 2”; Proceedings of IEEE Symposium on FPGAS for Custom Computing Machines; Apr. 19, 1995; pp. 204-213; Los Alamitos, California.Applicant
- Schmit; “Incremental Reconfiguration for Pipelined Applications”; Dept. of ECE, Carnegie Mellon University 1997, Pittsburgh, PA.Applicant
- Office Action for JP Application No. 2001-577212 dated May 19, 2009.Applicant
- Compton et al., “Reconfigurable Computing: A Survey of Systems and Software”, Technical Report, Northwestern University, Dept. of ECE, 1999, presented by Yi-Gang Tai, All Pages.Applicant
- International Search Report for PCT/US2006/006105 dated Oct. 31, 2006, All Pages.Applicant
- International Search Report for PCT/US2007/075723 dated Jul. 25, 2008, All Pages.Applicant
- Office Action for U.S. Appl. No. 11/836,947 dated Feb. 5, 2009, All Pages.Applicant