4592 search results - page 18 / 919 » Framework for Studying Substitution |
110
click to vote
LOPSTR
1994
Springer
15 years 3 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
175
Voted
POPL
2006
ACM
16 years 2 days ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
ITA
2008
14 years 11 months ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
BMCBI
2006
14 years 11 months ago
2006
Background: Algorithms that locate evolutionarily conserved sequences have become powerful tools for finding functional DNA elements, including transcription factor binding sites;...
105
Voted
BMCBI
2007
14 years 11 months ago
2007
Background: Coalescent simulations have proven very useful in many population genetics studies. In order to arrive to meaningful conclusions, it is important that these simulation...