Samuel Lee Franklin

US Patent:

6406892, Jun 18, 2002

Filed:

May 23, 2001

Appl. No.:

09/866093

Inventors:

Cheryl S. Aberin - Rodeo CA
Samuel G. Franklin - El Sobrante CA

Assignee:

Bio-Rad Laboratories, Inc. - Hercules CA

International Classification:

C12P 1934

US Classification:

435 911

Abstract:

Plasmid DNA is purified from a cell lysate by acidifying the lysate with a combination of a mineral acid and an inorganic salt in place of the commonly used acetate buffer, allowing chromosomal DNA and other impurities to precipitate out and recovering the supernatant, and applying the supernatant directly to a hydroxyapatite chromatographic separation medium. The use of the mineral acid and organic salt avoids the degradation of the hydroxyapatite that frequently accompanies repeated use with acetate and related compounds.

US Patent:

20170262899, Sep 14, 2017

Filed:

Feb 11, 2017

Appl. No.:

15/430467

Inventors:

- New York NY, US
Hua Ai - Atlanta GA, US
Henry Beaver - Decatur GA, US
Jason B. Bell - Atlanta GA, US
Patrick D. Callow - Loganville GA, US
Ye Chen - Atlanta GA, US
Amit Dingare - Duluth GA, US
Jonathan M. Donovan - Marietta GA, US
Samuel Franklin - Atlanta GA, US
Jason Hartley - Brooklyn NY, US
Munehiro Nakayama - Tucker GA, US
Lawrence Arthur O'Donnell - Atlanta GA, US
Vu Pham - Atlanta GA, US
Manoranjan Satapathy - Johns Creek GA, US
Mehmet Eric Sonmezer - Atlanta GA, US
Bruce Williams - Chicago IL, US
Aleksey Yurchenko - Atlanta GA, US

Assignee:

360i LLC - New York NY

International Classification:

G06Q 30/02
G06N 5/04

Abstract:

A computer has a processor and nontransitory memory. The computer receives a list of search keywords to propose to a search engine. For search keywords that are too infrequently used to have historical data to estimate keyword performance, the computer computes linguistic similarity between the sparse-data keyword to other keywords that have sufficient historical keyword performance data to permit a statistically sound estimate for keyword performance. The estimates are submitted to a search engine, and updated by grouping the sparse-data keywords into groups, including at least a high-performing group and a low-performing group, and reallocating budget from the keywords of the low-performing group to keywords of the high-performing group, by reducing estimates for keywords of the low-performing group and increasing estimates of keywords of the high-performing group.