Back to Results
First PageMeta Content
Mathematics / Closest string / Q / Substring / Randomized algorithm / Theoretical computer science / Applied mathematics / Functional languages


On the Closest String and Substring Problems MING LI University of Waterloo, Waterloo, Ont., Canada
Add to Reading List

Document Date: 2002-10-22 23:10:24

Open Document

File Size: 150,62 KB

Share Result on Facebook

City

Atlanta / Que. / Santa Barbara / Montreal / New York / Waterloo / Kowloon / /

Company

ACM Inc. / Hertz / /

Country

Canada / China / United States / /

Currency

pence / USD / /

/

Facility

City University of Hong Kong / Canada BIN MA University of Western Ontario / Canada AND LUSHENG WANG City University of Hong Kong / University of Western Ontario / Substring Problems MING LI University of Waterloo / University of California / /

/

IndustryTerm

near-optimal approximation algorithms / genetic drug target search / polynomial-time approximation algorithms / involved approximation algorithms / approximation algorithm / polynomial time algorithm / approximate solution / fractional solution / above randomized algorithm / partial approximation solution / center-replacing algorithm / approximation algorithms / /

Organization

National Science Foundation / Department of Computer Science / University of Western Ontario / London / University of California / Santa Barbara / University of Waterloo / City University of Hong Kong / /

/

Position

General / /

ProvinceOrState

Alabama / New York / California / Ontario / /

PublishedMedium

Journal of the ACM / Theory of Computing / /

Region

Western Ontario / /

Technology

bioinformatics / randomized algorithm / polynomial time algorithm / involved approximation algorithms / approximation algorithm / 4/3 approximation algorithms / center-replacing algorithm / 165 Algorithm / approximation algorithms / two polynomial-time approximation algorithms / ratio-2 algorithm / above randomized algorithm / /

SocialTag