Igor Yu Popov, Anastasiya V Vorobyova, Irina V Blinova
{"title":"时间表问题的dna算法。","authors":"Igor Yu Popov, Anastasiya V Vorobyova, Irina V Blinova","doi":"10.1504/IJBRA.2014.059520","DOIUrl":null,"url":null,"abstract":"<p><p>Using of DNA molecules for solving of NP-complete problems is discussed. Properties of DNA allow one to reduce the number of operations from exponential to polynomial. DNA-algorithm for solving of the timetable problem is suggested. The starting point is a set of classes, teachers and hours with some limitations. It is necessary to determine whether there is a timetable satisfying all limitations. The sets of classes, teachers and hours are coded by chains of nucleotides. After preparing of the input multi-set containing all possible timetables the filtering procedure should be made. It allows to exclude all illegal timetables. The filtering algorithm is suggested. An example is described. The analysis of the algorithm is made. </p>","PeriodicalId":35444,"journal":{"name":"International Journal of Bioinformatics Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1504/IJBRA.2014.059520","citationCount":"1","resultStr":"{\"title\":\"DNA-algorithm for timetable problem.\",\"authors\":\"Igor Yu Popov, Anastasiya V Vorobyova, Irina V Blinova\",\"doi\":\"10.1504/IJBRA.2014.059520\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Using of DNA molecules for solving of NP-complete problems is discussed. Properties of DNA allow one to reduce the number of operations from exponential to polynomial. DNA-algorithm for solving of the timetable problem is suggested. The starting point is a set of classes, teachers and hours with some limitations. It is necessary to determine whether there is a timetable satisfying all limitations. The sets of classes, teachers and hours are coded by chains of nucleotides. After preparing of the input multi-set containing all possible timetables the filtering procedure should be made. It allows to exclude all illegal timetables. The filtering algorithm is suggested. An example is described. The analysis of the algorithm is made. </p>\",\"PeriodicalId\":35444,\"journal\":{\"name\":\"International Journal of Bioinformatics Research and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1504/IJBRA.2014.059520\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Bioinformatics Research and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJBRA.2014.059520\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Health Professions\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Bioinformatics Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJBRA.2014.059520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Health Professions","Score":null,"Total":0}
Using of DNA molecules for solving of NP-complete problems is discussed. Properties of DNA allow one to reduce the number of operations from exponential to polynomial. DNA-algorithm for solving of the timetable problem is suggested. The starting point is a set of classes, teachers and hours with some limitations. It is necessary to determine whether there is a timetable satisfying all limitations. The sets of classes, teachers and hours are coded by chains of nucleotides. After preparing of the input multi-set containing all possible timetables the filtering procedure should be made. It allows to exclude all illegal timetables. The filtering algorithm is suggested. An example is described. The analysis of the algorithm is made.
期刊介绍：
Bioinformatics is an interdisciplinary research field that combines biology, computer science, mathematics and statistics into a broad-based field that will have profound impacts on all fields of biology. The emphasis of IJBRA is on basic bioinformatics research methods, tool development, performance evaluation and their applications in biology. IJBRA addresses the most innovative developments, research issues and solutions in bioinformatics and computational biology and their applications. Topics covered include Databases, bio-grid, system biology Biomedical image processing, modelling and simulation Bio-ontology and data mining, DNA assembly, clustering, mapping Computational genomics/proteomics Silico technology: computational intelligence, high performance computing E-health, telemedicine Gene expression, microarrays, identification, annotation Genetic algorithms, fuzzy logic, neural networks, data visualisation Hidden Markov models, machine learning, support vector machines Molecular evolution, phylogeny, modelling, simulation, sequence analysis Parallel algorithms/architectures, computational structural biology Phylogeny reconstruction algorithms, physiome, protein structure prediction Sequence assembly, search, alignment Signalling/computational biomedical data engineering Simulated annealing, statistical analysis, stochastic grammars.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
