Main navigation | Main content

HOME » PROGRAMS/ACTIVITIES » Annual Thematic Program

PROGRAMS/ACTIVITIES

Annual Thematic Program »Postdoctoral Fellowships »Hot Topics and Special »Public Lectures »New Directions »PI Programs »Math Modeling »Seminars »Be an Organizer »Annual »Hot Topics »PI Summer »PI Conference »Applying to Participate »

Talk Abstract

Adapting and Applying Simplical Complex Q-Analysis to Studying Sequence Similarity Databases

Adapting and Applying Simplical Complex Q-Analysis to Studying Sequence Similarity Databases

**John V. Carlis **

Computer Science and Engineering

University of Minnesota

carlis@cs.umn.edu

http://www.cs.umn.edu/~carlis

Q-analysis of simplical complexes is a well known mathematical notion. In this talk I will first restate the problem that Q-analysis addresses in database terms, that is, present a logical data model of the raw data and of derived data. Second, I will show that most of Q-analysis can be done with existing database operators. Third I will introduce new database operators that allow Q-analysis to be done entirely with relational operators. Fourth, I will show Q-analysis applied to sequence similarity data to find paths of connected sequences. Finally, I will demonstrate how relaxing Q-analysis constraints connects it to the more general problem of finding clusters of sequences.