Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Patent searches for genetic sequences: How to retrieve relevant records from patented sequence databases

Results from current homology-based search tools, designed to locate biologically relevant sequences, present a level of uncertainty from an intellectual property standpoint.

This is a preview of subscription content, access via your institution

Relevant articles

Open Access articles citing this article.

Access options

Buy article

Get time limited or full article access on ReadCube.

$32.00

All prices are NET prices.

Figure 1: Comparison of KERR and two possible BLAST outcomes.
Figure 2: Schematic representation of two possible KERR outcomes.

References

  1. Ouellette, B.F. & Boguski, M.S. Database divisions and homology search files: a guide for the perplexed. Genome Res. 10, 952–955 (1997).

    Article  Google Scholar 

  2. Derwent GENESEQ (http://www.derwent.com/geneseq/).

  3. Altschul, S.F. et al. Basic local alignment search tool. J. Mol. Biol. 215, 403–410 (1990).

    Article  CAS  Google Scholar 

  4. Pearson, W. Using the FASTA program to search protein and DNA sequence databases. Methods Mol. Biol. 25, 365–389 (1994).

    CAS  PubMed  Google Scholar 

  5. CAS Registry BLAST Similarity Searching via STN Reference Guide (http://www.cas.org/ONLINE/QRGUIDES/blast.pdf) (2002).

  6. Altschul, S.F. et al. Issues in searching molecular sequence databases. Nat. Genet. 6, 119–129 (1994).

    Article  CAS  Google Scholar 

  7. US Patent and Trademark Office, Manual of Patent Examining Procedure (MPEP) Edn. 8, August, 2001, Chapter 8, Section 803.04, Restriction—Nucleotide (http://patents.ame.nd.edu/mpep/8/803.04.html)

  8. Baeza-Yates, R. & Navarro, G. Faster approximate string matching. Algorithmica 23, 127–158 (1999).

    Article  Google Scholar 

  9. Navarro, G. A guided tour to approximate string matching. ACM Comput. Surv., 33, 31–88 (2001).

    Article  Google Scholar 

  10. Landau, G.M. et al. An efficient string matching algorithm with k differences for nucleotide and amino acid sequences. Nucleic Acids Res. 14, 31–46 (1986).

    Article  CAS  Google Scholar 

  11. Gene-IT. Biofacet User Manual (2002).

  12. Neufeld, G. et al. Similarities and differences between the vascular endothelial growth factor (VEGF) splice variants. Cancer Metastasis Rev. 15, 153–158 (1996).

    Article  CAS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to László Takács.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Dufresne, G., Takács, L., Heus, H. et al. Patent searches for genetic sequences: How to retrieve relevant records from patented sequence databases. Nat Biotechnol 20, 1269–1271 (2002). https://doi.org/10.1038/nbt1202-1269

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1038/nbt1202-1269

This article is cited by

Search

Quick links

Nature Briefing

Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing