Sciweavers

516 search results - page 77 / 104
» Sets of k-Independent Strings
Sort
View
DATE
2008
IEEE
76views Hardware» more  DATE 2008»
14 years 3 months ago
Front End Device for Content Networking
The bandwidth and speed of network connections are continually increasing. The speed increase in network technology is set to soon outpace the speed increase in CMOS technology. T...
Jeremy Buboltz, Taskin Koçak
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
14 years 2 months ago
Geometric crossovers for real-code representation
Geometric crossover is a representation-independent generalization of the class of traditional mask-based crossover for binary strings. It is based on the distance of the search s...
Yourim Yoon, Yong-Hyuk Kim, Alberto Moraglio, Byun...
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
14 years 2 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
BIBE
2005
IEEE
107views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
DSIM: A Distance-Based Indexing Method for Genomic Sequences
In this paper, we propose a Distance-based Sequence Indexing Method (DSIM) for indexing and searching genome databases. Borrowing the idea of video compression, we compress the ge...
Xia Cao, Beng Chin Ooi, HweeHwa Pang, Kian-Lee Tan...
CPM
2005
Springer
109views Combinatorics» more  CPM 2005»
14 years 2 months ago
Using PQ Trees for Comparative Genomics
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
Gad M. Landau, Laxmi Parida, Oren Weimann