699 search results - page 125 / 140 » The method of combinatorial telescoping |
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
The assignment of orthologous genes between a pair of genomes is a fundamental and challenging problem in comparative genomics, since many computational methods for solving various...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
DNA probe arrays have emerged as a core genomic technology that enables cost-effective gene expression monitoring, mutation detection, single nucleotide polymorphism analysis and ...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
ESORICS
2007
Springer
14 years 2 months ago
2007
Springer
A number of network covert channels have been proposed recently that may have important ramifications for Internet security and privacy. However, they could become ineffective in...