See this document in CiteSeerX!

Reusable Dynamic Programming:Updating Sequence Alignment  (Make Corrections)  
Changjin Hong and Ahmed H. Tewfik Department of Electrical and Computer...



  Home/Search   Context   Related

 
View or download:
umn.edu/users/hong...nsips06_vfinal.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umn.edu/users/hongc...publication (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Sequence alignment in genomics and proteomics is mostly done via dynamic programming (DP) based approaches. In this work, we show how computational results from DP can be reused to update alignments when analyzing new versions of a sequence. We derive relative tolerance bounds on node distances from a root node that guarantee that partial shortest path distances remain optimal. We then propose an algorithm that uses these bounds to skip all unperturbed parts of a sequence when recomputing an... (Update)

Active bibliography (related documents):   More   All
0.2:   Efficient Algorithms for Robustness in Matroid Optimization - Greg Frederickson Roberto (1996)   (Correct)
0.2:   Increasing the Weight of Minimum Spanning Trees - Frederickson, Solis-Oba (1996)   (Correct)
0.2:   A Linear Algorithm for Analysis of Minimum Spanning and.. - Booth, Westbrook (1992)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ and-reusable,
  author = "Changjin Hong And",
  title = "Reusable Dynamic Programming:updating Sequence Alignment",
  url = "citeseer.ist.psu.edu/765228.html" }
Citations (may not include all citations):
3972   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1992
431   A Basic Local Alignment Search Tool (context) - Altschul, Gish et al. - 1990
57   Algorithms for the Longest Common Subsequence Problem (context) - Hirschberg - 1977
5   Arc Tolerances in Shortest Path and Network Flow Problems (context) - Shier - 1980
1   Finding the K Smallest Spanning Trees - Eppstein - 1990
1   Handling Updates of A Biological Sequence Based on Hidden Ma.. (context) - Hong, Tewfik et al. - 2005
http://www.ncbi.nlm.nih.gov/

Documents on the same site (http://www.ece.umn.edu/users/hongcj92/doc/publication.htm):
Global Pairwise Sequence Alignments With Multiple Scoring - Matrices Changjin Hong   (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