Mathieu Blanchette, Benno Schwikowski, and Martin Tompa Department of...  Home/Search
Context Related
| washington.edu/homes/tom...orthojcb.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: washington.edu/homes/tompa/pap... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Phylogenetic footprinting is a technique that identi es regulatory elements by nding unusually well conserved regions in a set of orthologous non-coding DNA sequences from multiple species. We introduce a new motif- nding problem, the Substring Parsimony Problem, which is a formalization of the ideas behind phylogenetic footprinting, and we present an exact dynamic programming algorithm to solve it. We then present a number of algorithmic optimizations that allow our program to run... (Update)
Similar documents based on text: More All
0.8: Algorithms for Phylogenetic Footprinting - Blanchette, Schwikowski, Tompa (2001) (Correct)
0.7: Discovery of Regulatory Elements by a Computational Method.. - Blanchette, Tompa (2002) (Correct)
0.7: An Exact Algorithm to Identify Motifs in Orthologous.. - Blanchette.. (2000) (Correct)
BibTeX entry: (Update)
M. Blanchette. Algorithms for phylogenetic footprinting. In RECOMB01: Proceedings of the Fifth Annual International Conference on Computational Molecular Biology, Montreal, Canada, Apr. 2001. http://citeseer.ist.psu.edu/blanchette01algorithms.html More
@inproceedings{ blanchette01algorithms,
author = "Mathieu Blanchette",
title = "Algorithms for phylogenetic footprinting",
booktitle = "{RECOMB}",
pages = "49-58",
year = "2001",
url = "citeseer.ist.psu.edu/blanchette01algorithms.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.washington.edu/homes/tompa/papers/): More
An Exact Method for Finding Short Motifs in Sequences, with.. - Tompa (1999) (Correct)
A Linear Time Algorithm for Finding All Maximal Scoring.. - Ruzzo, Tompa (1999) (Correct)
Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC