20 search results - page 2 / 4 » Comparing global and local mutations on bit strings |
CPM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Local similarity is an important tool in comparative analysis of biological sequences, and is therefore well studied. In particular, the Smith-Waterman technique and its ...
BMCBI
2008
13 years 5 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
CEC
2008
IEEE
13 years 12 months ago
2008
IEEE
—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
FECS
2006
13 years 6 months ago
2006
Program plagiarism is one of the most significant problems in Computer Science education. Most common plagiarism includes modifying comments, reordering statements, and changing v...
SPAA
2009
ACM
14 years 5 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...