1 resultado para Lagrangian bounds
em Brock University, Canada
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (4)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- Aquatic Commons (7)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (7)
- Aston University Research Archive (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (10)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (16)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (14)
- Boston University Digital Common (20)
- Brock University, Canada (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (37)
- Cambridge University Engineering Department Publications Database (72)
- CentAUR: Central Archive University of Reading - UK (26)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (67)
- Cochin University of Science & Technology (CUSAT), India (1)
- Coffee Science - Universidade Federal de Lavras (3)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (4)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (18)
- Department of Computer Science E-Repository - King's College London, Strand, London (8)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (5)
- Digital Commons - Michigan Tech (2)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Duke University (14)
- Earth Simulator Research Results Repository (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (24)
- Helda - Digital Repository of University of Helsinki (15)
- Indian Institute of Science - Bangalore - Índia (245)
- INSTITUTO DE PESQUISAS ENERGÉTICAS E NUCLEARES (IPEN) - Repositório Digital da Produção Técnico Científica - BibliotecaTerezine Arantes Ferra (1)
- Instituto Politécnico do Porto, Portugal (1)
- Massachusetts Institute of Technology (11)
- National Center for Biotechnology Information - NCBI (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (27)
- Publishing Network for Geoscientific & Environmental Data (4)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (20)
- Queensland University of Technology - ePrints Archive (131)
- Repositório digital da Fundação Getúlio Vargas - FGV (7)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (57)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (17)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (5)
- University of Connecticut - USA (1)
- University of Michigan (12)
- University of Queensland eSpace - Australia (5)
- University of Washington (4)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.