Isolated Polypeptides, Polynucleotides Encoding Same, Transgenic Plants Expressing Same and Methods of Using Same
US 8,962,915 Term endedTerm ended no later than Aug 20, 2026 · Low confidence
20-year base term ended Jun 14, 2025
Jun 14, 2005
Aug 20, 2026
Feb 24, 2015
How we calculated this date
| Step | Input | Date after this step | Confidence |
|---|---|---|---|
| Base term, 20 years from filing | Clock starts Jun 14, 2005, when the earliest non-provisional application in its chain was filed (this one was filed Apr 23, 2008); a parent in its chain could not be resolved (the next row) | Jun 14, 2025 | High confidence |
| Continuity chain | A parent in the chain could not be resolved | dated from this application's own claim | Medium confidence |
| Patent term adjustment | +432 days, USPTO patent term adjustment record | Aug 20, 2026 | High confidence |
| Terminal disclaimer cap | Disclaimer on file (approved), reference document not resolved | no cap applied, and none guessed | Medium confidence |
| Patent term extension | None on file | no change | High confidence |
| Fee events | 2 of 2 maintenance fees paid | term ended | High confidence |
| Computed term end | The steps above, in order | no later than Aug 20, 2026 | Low confidence |
Sources
Google Patents · The patent document at USPTO · Assignment records at USPTO
USPTO account required: This application in Patent Center · USPTO's maintenance fee lookup
Maintenance fee events come from USPTO's own fee records. Its fee lookup asks for the patent number and the application number.
Not on this page: the patent's family, its recorded assignments and its citation count. USPTO's assignment records, linked above, list every recorded assignment.
Every date shows its work: the base term, any term adjustment or extension, any disclaimer cap, and the maintenance fee record, each with a confidence tier. How this record was built
This computed term ends no later than the date shown; an unresolved terminal disclaimer may end it earlier. Related patents and pending applications may cover overlapping subject matter.