Veuillez choisir le dossier dans lequel vous souhaitez ajouter ce contenu :
Filtrer les résultats
Colloque
Biological data, such as DNA sequences, can be effectively analyzed for structure and patterns using techniques such as computational grammars. One type of grammar that is expressive, flexible, and readily implemented is definite clause grammars (DCGs). High-level computational paradigms such as constraint logic programming (CLP) allow the effective modelling of problems from the natural sciences involving rules and constraints, and efficient solution of those problems. Both DCGs and CLP are supported by most modern logic programming (LP) systems. Triplex DNA is a naturally occuring conformation where a nucleotide sequence binds to a purine-rich strand of a conventional DNA duplex. Tailored …
