{"search_session":{},"preferences":{"l":"en","queryLanguage":"en"},"patentId":"099-407-864-170-637","frontPageModel":{"patentViewModel":{"ref":{"entityRefType":"PATENT","entityRefId":"099-407-864-170-637"},"entityMetadata":{"linkedIds":{"empty":true},"tags":[],"collections":[{"id":10791,"type":"PATENT","title":"The Hebrew University of Jerusalem - Patent Portfolio","description":"","access":"OPEN_ACCESS","displayAvatar":true,"attested":false,"itemCount":7593,"tags":[],"user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"notes":[{"id":8259,"type":"COLLECTION","user":{"id":91044780,"username":"Cambialens","firstName":"","lastName":"","created":"2015-05-04T00:55:26.000Z","displayName":"Cambialens","preferences":"{\"usage\":\"public\",\"beta\":false}","accountType":"PERSONAL","isOauthOnly":false},"text":"
Search Applicants and Owners separately: \"hebrew univ* jerusalem\"; \"hebrew univ* jerus*\"
Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1457
Search Applicants and Owners separately: \"hebrew univ* jerusalem\"; \"hebrew univ* jerus*\"
Select more for logical variants. Add to collection. Select all patents in the collection and expand by simple families. Add to collection. Total patents: 1457
generating a set of decisions associated with values (k,n) for determining whether the patterns match, where k, is a number of non similar homologous regions from a sample of size, n, of the homologous regions;\n
constraining the decisions so that a probability of providing a false negative decision that there is no match when in fact there is a match is less than or equal to a predetermined upper bound α;\n
configuring the association of decisions and pairs (k,n) to minimize running time of a computer programmed to use the set of decisions to determine whether there is a match; and\n
using a computer programmed with the set of decisions to determine if the patterns match."],"number":1,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the set of decisions comprises:\n
a decision, NS, that the patterns do not match associated with each of a first set of pairs of values (k,n) and having a probability less than or equal to α; and\n
a decision, C, for each of a second set of pairs of values (k,n) that the sample n must be increased to determine whether the patterns match."],"number":2,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the probability of being wrong and providing a false negative decision is determined responsive to a prior probability for frequency of occurrence of regions that are not similar."],"number":3,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 2 wherein the set of decisions comprises a decision, S, associated with a third set of pairs of values (k,n) that the patterns match."],"number":4,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 4 wherein S has a probability of being incorrect and providing a false positive decision that there is a match when in fact there isn't, has a probability less than or equal to a predetermined upper bound β."],"number":5,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 5 wherein the probability of a decision S being wrong is determined responsive to a prior probability for frequency of occurrence of regions that are not similar."],"number":6,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 4 and comprising a decision E to determine how many non-similar homologous regions there are from among all the homologous regions associated with a fourth set of values (k,n)."],"number":7,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 7 wherein all the decisions NS, S and E are associated with pairs of values (k,n) having a same n."],"number":8,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 and comprising a decision E to determine how many non-similar homologous regions there are from among all the homologous regions associated with a fourth set of values (k,n)."],"number":9,"annotation":false,"title":false,"claim":true},{"lines":["(canceled)"],"number":10,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 1 wherein the association of decisions and pairs (k,n) are configured to minimize a loss function responsive to the running time."],"number":11,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 11 wherein the loss function comprises a sum of an expected running time, a weighted probability of providing a false negative decision and a weighted probability of providing a false positive decision."],"number":12,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 12 wherein the weight for the false negative probability is less than or equal to RE(0)/[αP(D≦t)] where RE(0) is a running time for the computer to determine how many non-similar homologous regions from among all the homologous regions and P(D≦t) is a probability that the patterns in fact match."],"number":13,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 13 wherein the weight for the false positive probability is less than or equal to RE(0)/[βP(D>t) where P(D>t) is a probability that the patterns in fact do not match."],"number":14,"annotation":false,"title":false,"claim":true},{"lines":["15-28. (canceled)"],"number":-1,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions for determining whether first and second patterns having a plurality of homologous regions match responsive to a number, k, of non similar homologous regions from a sample of size, n, of the homologous regions, the set of decisions comprising:\n
a decision, NS, that the patterns do not match associated with each of a first set of pairs of values (k,n) and having a probability less than or equal to a predetermined upper bound α of being wrong and providing a false negative decision when in fact there is a match; and\n
a decision, C, for each of a second set of pairs of values (k,n) that the sample n must be increased to determine whether the patterns match; wherein\n
the association of decisions and pairs (k,n) is configured so that if a computer is used to determine k for an increasing number n until a decision as to whether there is a match is provided, a running time for reaching the decision is substantially minimized."],"number":29,"annotation":false,"title":false,"claim":true},{"lines":["30-33. (canceled)"],"number":-1,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions according to claim 29 and comprising a decision E to determine how many non-similar homologous regions there are from among all the homologous regions associated with a third set of values (k,n)."],"number":34,"annotation":false,"title":false,"claim":true},{"lines":["A set of decisions according to claim 34 wherein all the decisions NS, E, and a decision, S that the patterns match, associated with a fourth set of pairs of values (k,n), are associated with pairs of values (k,n) having a same n."],"number":35,"annotation":false,"title":false,"claim":true},{"lines":["36-41. (canceled)"],"number":-1,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 29 wherein the patterns are patterns comprised in a temporal sequence of events."],"number":42,"annotation":false,"title":false,"claim":true},{"lines":["(canceled)"],"number":43,"annotation":false,"title":false,"claim":true},{"lines":["A method according to claim 42 wherein the sequence of events comprises an audio stream."],"number":44,"annotation":false,"title":false,"claim":true},{"lines":["(canceled)"],"number":45,"annotation":false,"title":false,"claim":true},{"lines":["A computer readable medium containing a set of decisions in accordance with claim 29 for programming a processor to determine if two patterns match."],"number":46,"annotation":false,"title":false,"claim":true},{"lines":["(canceled)"],"number":47,"annotation":false,"title":false,"claim":true},{"lines":["A computer readable medium containing a set of instructions for programming a processor to determine if two patterns match in accordance with claim 1."],"number":48,"annotation":false,"title":false,"claim":true},{"lines":["A signal set containing instructions for determining if two patterns match in accordance with claim 1."],"number":49,"annotation":false,"title":false,"claim":true}]}},"filters":{"npl":[],"notNpl":[],"applicant":[],"notApplicant":[],"inventor":[],"notInventor":[],"owner":[],"notOwner":[],"tags":[],"dates":[],"types":[],"notTypes":[],"j":[],"notJ":[],"fj":[],"notFj":[],"classIpcr":[],"notClassIpcr":[],"classNat":[],"notClassNat":[],"classCpc":[],"notClassCpc":[],"so":[],"notSo":[],"sat":[]},"sequenceFilters":{"s":"SEQIDNO","d":"ASCENDING","p":0,"n":10,"sp":[],"si":[],"len":[],"t":[],"loc":[]}}