Sciweavers

1421 search results - page 86 / 285
» Algorithms for subsequence combinatorics
Sort
View
BIBE
2007
IEEE
147views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
A New Alignment-Independent Algorithm for Clustering Protein Sequences
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski
SIGADA
2004
Springer
15 years 9 months ago
Comparative analysis of genetic algorithm implementations
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
Robert Soricone, Melvin Neville
CSL
2008
Springer
15 years 6 months ago
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
Sven Schewe
ICDAR
2011
IEEE
14 years 3 months ago
A New Text-Line Alignment Approach Based on Piece-Wise Painting Algorithm for Handwritten Documents
—Because of writing styles of different individuals, some of the text-lines may be curved in shape. For recognition of such text-lines, their proper alignment is necessary. In th...
Alireza Alaei, P. Nagabhushan, Umapada Pal
TKDE
2012
245views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung