论文信息 - An Algorithm Based on Diagonal Feature for Local Alignment in Large Database - 字舞流文

An Algorithm Based on Diagonal Feature for Local Alignment in Large Database

Xingming Sun | Decai Sun | Xiaoxia Wang | Zhiqiang Ruan

[1] H. Bostan,et al. Nucleotide Sequence Analysis for Assessment of Variability of Potato Leafroll Virus and Phylogenetic Comparisons , 2002 .

[2] Erkki Sutinen,et al. Filtration with q-Samples in Approximate String Matching , 1996, CPM.

[3] Eugene W. Myers,et al. A fast bit-vector algorithm for approximate string matching based on dynamic programming , 1998, JACM.

[4] R. Khurshid,et al. Amino Acid Sequence Homology and Modeling of Cysteine Protease Cathepsin S , 2000 .

[5] William F. Smyth,et al. Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory , 2006, SPIRE.

[6] Xinyu Wang,et al. Distributed Index based on Geographic Hashing Table for Mobile Ad Hoc Networks , 2009 .

[7] Esko Ukkonen,et al. Two Algorithms for Approximate String Matching in Static Texts , 1991, MFCS.

[8] Peter Sanders,et al. Linear work suffix array construction , 2006, JACM.

[9] Omid Karami,et al. Sequence Analysis and Phylogeny of VirD4 Protein of Type IV Secretion System in Gram-Negative Bacteria , 2008 .

[10] Yasar Guneri Sahin,et al. Face Matrix: A Quick Search and Indexing Method for Suspect Recognition in Police Departments , 2007 .