Sequence identification and analysis

Details Sequence identification and analysis Sequence identification and analysis

2007-08-24

2010-10-05

Lee, Wilson (Department: 2163)

Data processing: database and file management or data structures

Database design

Database and data structure management

C707S803000, C707S804000

Reexamination Certificate

active

07809765

ABSTRACT:
The present technique provides for the analysis of a data series to identify sequences of interest within the series. Specifically, in accordance with one embodiment of the present technique, a method is provided comprising generating a data structure that stores characteristics about a plurality of sequences present in a data series. One or more sequences are identified based upon the contents of the data structure. In accordance with other aspects of the invention, more than one heuristic is calculated for each sequence under review. The plurality of heuristics associated with each sequence are evaluated to identify a sequence of interest.

REFERENCES:
patent: 5136686 (1992-08-01), Koza
patent: 5455577 (1995-10-01), Slivka et al.
patent: 5617552 (1997-04-01), Garber et al.
patent: 5703581 (1997-12-01), Matias et al.
patent: 6373971 (2002-04-01), Rigoutsos et al.
patent: 6473757 (2002-10-01), Garofalakis
patent: 7043371 (2006-05-01), Wheeler
patent: 2002/0183936 (2002-12-01), Kulp et al.
patent: 2003/0207312 (2003-11-01), Sorge
patent: 2004/0010504 (2004-01-01), Hinrichs et al.
patent: 2004/0249574 (2004-12-01), Tishby
patent: 2005/0227243 (2005-10-01), Deak et al.
patent: 2005/0273274 (2005-12-01), Evans
patent: 2006/0246490 (2006-11-01), Anderson et al.
patent: 2007/0180151 (2007-08-01), Richardson et al.
patent: 2008/0005547 (2008-01-01), Papakipos et al.
patent: 2008/0205280 (2008-08-01), Saphir
patent: 2009/0216521 (2009-08-01), Swoboda et al.
Moses Charikar et al., “Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models”, Proceedings of Annual ACM Symposium, Feb. 20, 2002, pp. 792-801.
S.C. Evans and S.F. Bush, “Symbol Compression Ratio for String Compression and Estimation of Kolmogorov Complexity”, Nov. 2001, 16 Pages.
Craig G. Nevill-Manning and Ian H. Witten, “On-Line and Off-Line Heuristics for Inferring Hierarchies of Repetitions in Sequences”, Proceedings of the IEEE, vol. 88, No. 11, Nov. 2000, pp. 1745-1755.
Alberto Apostolico and Stefano Lonardi, “Off-Line Compression by Greedy Textual Substitution”, Proceedings of the IEEE, vol. 88, No. 11, Nov. 2000, pp. 1733-1744.
Scott C. Evans et al., “microRNA Target Detection and Analysis for Genes Related to Breast Cancer Using MDLcompress”; www.hindawi.com/journals/bsb/raa.43670.html.
S.C. Evans et al., “An Improved Minimum Description Length Learning Algorithm for Nucleotide Sequence Analysis”, Proceedings of IEEE 40thAsilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, Nov. 2006.
A. Apostolico et al., “Off-line Compression by Greedy Textual Substitution”, Proc. IEEE, 88(11): 1733-1744.
O. G. Troyanskaya et al.; Title: “Sequence Complexity Profiles of Prokaryotic Genome Sequences: A fast Algorithm for Calculating Linguistic Complexity”; Bioinformatics; vol. 18 No. 5 2002; pp. 679-688.
Scott C. Evans; Title: “Kolmogorov Complexity Estimation and Application for Information System Security”; Rensselaer Polytechnic Institute; Troy, New York; Jul. 2003.

Affiliated with

Also associated with

Rating

Sequence identification and analysis does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sequence identification and analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sequence identification and analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4210412