Sciweavers

3136 search results - page 125 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
MRCO
2005
Springer
15 years 11 months ago
Identifying the Multiple Contexts of a Situation
Abstract. The paper presents a contexts recognition algorithm that uses the Internet as a knowledge base to extract the multiple contexts of a given situation, based on the streami...
Aviv Segev
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...
CJ
2008
90views more  CJ 2008»
15 years 6 months ago
Parameterized Complexity and Biopolymer Sequence Comparison
The article surveys parameterized algorithms and complexities for computational tasks on biopolymer sequences, including the problems of longest common subsequence, shortest commo...
Liming Cai, Xiuzhen Huang, Chunmei Liu, Frances A....
WIA
2007
Springer
16 years 13 days ago
Accelerating Boyer Moore Searches on Binary Texts
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important a...
Shmuel Tomi Klein, Miri Ben-Nissan
ICPADS
2005
IEEE
15 years 12 months ago
Exploiting Multi-level Parallelism for Homology Search using General Purpose Processors
New biological experimental techniques are continuing to generate large amounts of data using DNA, RNA, human genome and protein sequences. The quantity and quality of data from t...
Xiandong Meng, Vipin Chaudhary