See this document in CiteSeerX!

Learning Signi  (Make Corrections)  
cant Alignments: An Alternative to Normalized Local Alignment Eric Breimer...



  Home/Search   Context   Related

 
View or download:
rpi.edu/research/ps/027.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rpi.edu/research/tr (more)
(Enter author homepages)

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

Abstract: We describe a supervised learning approach to resolve dif- culties in nding biologically signi cant local alignments. It was noticed that the O(n ) algorithm by Smith-Waterman, the prevalent tool for computing local sequence alignment, often outputs long, meaningless alignments while ignoring shorter, biologically signi cant ones. Arslan et. al. proposed an O(n log n) algorithm which outputs a normalized local alignment that maximizes the degree of similarity rather than the... (Update)

Active bibliography (related documents):   More   All
3.5:   Learning Significant Alignments: An Alternative to.. - Breimer, Goldberg   (Correct)
1.0:   Bioinformatics - Vol No Pages   (Correct)
0.6:   A New Approach to Sequence Comparison: Normalized.. - Arslan, Egecioglu.. (2001)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ an-learning,
  author = "Cant Alignments An",
  title = "Learning Signi",
  url = "citeseer.ist.psu.edu/751086.html" }
Citations (may not include all citations):
266   Gapped Blast and Psi-Blast: a new generation of protein data.. - Altschul, Madden et al. - 1997
36   Identi cation of common molecular subsequences (context) - Smith, Waterman - 1981
21   On nonlinear fractional programming (context) - Dinkelbach - 1967
16   Gene recognition via spliced sequence alignment (context) - Gelfand, Mironov et al. - 1996
14   Fast computation of normalized edit distances (context) - Vidal, Marzal et al. - 1995
12   Alignments without low-scoring regions (context) - Zhang, Berman et al. - 1998
10   A new approach to sequence comparison: normalized sequence a.. - Arslan, gecio et al. - 2001
10   Post-processing long pairwise alignments (context) - Zhang, Berman et al. - 1999
9   The normalized string editing problem revisited - Oommen, Zhang - 1996
7   Pattern recognition in nucleic acid sequences: a general met.. (context) - Goad, Kanehisa - 1982
7   Statistical signi cance of ungapped alignments (context) - Alexandrov, Solovyev - 1998
7   Signi cance levels for biological sequence comparison using .. (context) - Altschul, Erickson - 1988
7   Suboptimal sequence alignment in molecular biology: alignmen.. (context) - Zuker - 1991
5   Parametric recomputing in alignment graph (context) - Huang, Pevzner et al. - 1994
3   Comparative analysis of mouse and human DNA and application .. (context) - Batzoglou, Pachter et al. - 2000
3   An ecient algorithm to locate all locally optimal alignments.. (context) - Barton - 1993
2   An ecient uniform-cost normalized edit distance algorithm (context) - Arslan, gecio - 1999
2   Pattern recognition in genetic sequences by mismatch density (context) - Seller - 1984
2   The conserved exon method of gene nding (context) - Bafna, Huson - 2000

Documents on the same site (http://www.cs.rpi.edu/research/tr.html):   More
MIRAGE: A Framework for Mining, Exploring and Visualizing.. - Zaki, Phoophakdee   (Correct)
Model Selection and Surface Merging in Reconstruction Algorithms - Bubna, Stewart (1997)   (Correct)
G isn't C! - LabVIEW and G as a Computing Language Course - Krishnamoorthy, Schupp (1999)   (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