Back to Results
First PageMeta Content
Models of computation / Mathematics / Symbol / Nondeterministic finite automaton / Formal languages / Cycle rank / Ε-quadratic form / Graph theory / Theoretical computer science / Automata theory


APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department of Computer Science University of Arizona Tucson, AZ 85721
Add to Reading List

Document Date: 2006-03-21 10:39:03

Open Document

File Size: 126,48 KB

Share Result on Facebook

Facility

Computer Science University of Arizona Tucson / /

IndustryTerm

given activation site / dynamic programming algorithms / computing / earlier algorithm / sequence alignment algorithm / alignment algorithms / typical applications / simpler software / shortest path algorithm / space algorithm / search algorithms / /

Organization

Computer Science University of Arizona Tucson / APPROXIMATE MATCHING OF REGULAR EXPRESSIONS EUGENE W. MYERS† Department / WEBB MILLER Department / National Science Foundation / The Pennsylvania State University University / /

Person

EUGENE W. MYERS / /

Position

head / column-sum cost model for alignments / /

ProgrammingLanguage

R / /

ProvinceOrState

Arizona / Pennsylvania / /

Technology

earlier algorithm / alignment algorithms / R. The algorithms / second algorithm / dynamic programming algorithms / finite state machine / sequence alignment algorithm / shortest path algorithm / search algorithms / time algorithm / /

SocialTag