Fast Filter-and-Refine Algorithms for Subsequence Selection

• المؤلفون الرئيسيون: OOI, Beng-Chin, PANG, Hwee Hwa, WANG, Hao, WONG, Limsoon, YU, Cui
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2002
• الموضوعات: DNA sequences; approximate subsequence matching; biology; bitmap indexing structure; data sequence condensing; data sequence encoding; false positive removal; fast filter-and-refine algorithms; gene sequences; index sequence; large DNA sequence databases; large sequence databases; protein sequences; query processing; query string; response time; small space overhead; subsequence selection; Databases and Information Systems; Numerical Analysis and Scientific Computing
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/1144; https://ink.library.smu.edu.sg/context/sis_research/article/2143/viewcontent/FastFilterandRefine_edited_.pdf

Large sequence databases, such as protein, DNA and gene sequences in biology, are becoming increasingly common. An important operation on a sequence database is approximate subsequence matching, where all subsequences that are within some distance from a given query string are retrieved. This paper...