Rapid similarity search alorithm of nucleic acid database
スポンサーリンク
概要
- 論文の詳細を見る
Smith and Waterman dynamic programming algorithm is too computer intensive to be used for database search. Most of the common database search programs us approximate scores to reduce search time in stead of Smith and Waterman score. They do not consider all possible alignments and may miss some sequence similarities. We present an algorithm for database search which uses score table of k-tuples. The method calculates the upper limit of Smith and Waterman score for each database sequence in nearly interactive time. Calculated each upper limit of Smith and Waterman score prevents us from missing high sequence similarities.
- 日本バイオインフォマティクス学会の論文
日本バイオインフォマティクス学会 | 論文
- Performance Improvement in Protein N-Myristoyl Classification by BONSAI with Insignificant Indexing Symbol
- A combined pathway to simulate CDK-dependent phosphorylation and ARF-dependent stabilization for p53 transcriptional activity
- A versatile petri net based architecture for modeling and simulation of complex biological processes
- XML documentation of biopathways and their simulations in Genomic Object Net
- Prediction of debacle points for robustness of biological pathways by using recurrent neural networks