See this document in CiteSeerX!

Global Pairwise Sequence Alignments With Multiple Scoring  (Make Corrections)  
Matrices Changjin Hong and Ahmed H. Tewfik Department of Electrical and...



  Home/Search   Context   Related

 
View or download:
umn.edu/users/hong...cassp07_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: A necessity of repeating alignments on a same pair of sequences to select an appropriate scoring function to detect a significance of score motivates us to work on higher performance matching technique. While overlapping each alignments obtained through a set of typical scoring matrix with its default gap cost, we observe significant parameters that may induce a maximum deviation from a reference global alignment. We propose a percent identity and a wideness of the alignment as a potential... (Update)

Active bibliography (related documents):   More   All
0.2:   Graph Voronoi regions for interfacing planar graphs - Kämpke, Strobel   (Correct)
0.2:   Improving Particle Swarm Optimization by hybridization of.. - Løvbjerg (2002)   (Correct)
0.2:   Chebyshev Approximation of Discrete Polynomials and Splines - Park (1999)   (Correct)

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

BibTeX entry:   (Update)

@misc{ hong-global,
  author = "Matrices Changjin Hong",
  title = "Global Pairwise Sequence Alignments With Multiple Scoring",
  url = "citeseer.ist.psu.edu/762697.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
247   A General Method Applicable to the Search for Similarities i.. (context) - et - 1970
158   A Formal Basis for the Heuristic Determination of Minimum Co.. (context) - Hart, Nilsson et al. - 1968
7   Sparse dynamic programming (context) - Eppstein, Galil et al. - 1990
7   Bioinformatics: sequence and genome analysis (context) - Mount - 2001
4   Algorithms on Strings, Trees, and Sequences: Computer Scienc.. (context) - Gusfield - 1997
1   Parametric Optimization of Sequence Alginment (context) - Gusfield, Balasubramanian et al. - 1994
1   Statistical distributions of optimal global alignment scores.. (context) - Pang, Tang et al. - 2005
1   Suboptimal Local Alignments across Multiple Scoring Schemes .. (context) - Michael, Dieterich et al. - 2004
1   Statistical Significance in Biological Sequence Analysis (context) - et - 2006
1   Significance of Nucleotide Sequence Alignments (context) - Altschul, Erickson - 1985
1   Approximate global alignment of sequences (context) - Kahveci, Ramaswamy et al. - 2005
http://www.ncbi.nlm.nih.gov/
http://astral.berkeley.edu/

Documents on the same site (http://www.ece.umn.edu/users/hongcj92/doc/publication.htm):
Reusable Dynamic Programming:updating Sequence Alignment - Changjin Hong And   (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