DNA-algorithm for timetable problem.

Q4 Health Professions
Igor Yu Popov, Anastasiya V Vorobyova, Irina V Blinova
{"title":"DNA-algorithm for timetable problem.","authors":"Igor Yu Popov,&nbsp;Anastasiya V Vorobyova,&nbsp;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}
引用次数: 1

Abstract

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.

时间表问题的dna算法。
讨论了DNA分子在np完全问题中的应用。DNA的特性允许我们将运算次数从指数式减少到多项式式。提出了求解时间表问题的dna算法。起点是一系列的课程,老师和时间,有一些限制。有必要确定是否存在一个满足所有限制的时间表。课程、教师和课时的设置都是由核苷酸链编码的。在准备好包含所有可能时间表的输入多集后,应进行过滤程序。它允许排除所有非法的时间表。提出了滤波算法。给出了一个示例。对该算法进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Bioinformatics Research and Applications
International Journal of Bioinformatics Research and Applications Health Professions-Health Information Management
CiteScore
0.60
自引率
0.00%
发文量
26
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信