<p>Results obtained by MA, PBS, DR, IBS and MPBS for DNA instances in LargeRealSet. These are instances with a large number of lengthy strings taken from DNA sequences. We have considered 6 DNA datasets, each one comprising 10 different instances. Instances on each dataset are characterized by a number of strings () of the same length (). Table shows statistical values (mean () and standard deviation ()) for relative percentage difference (RPD) from best-known solutions of solutions obtained by each algorithm. n/a indicates that corresponding algorithm was not able to produce a solution to instances in dataset within allowed execution time.</p
The data provided here contains experimental results, all Matlab codes for statistical analysis and ...
Abstract. For DNA computing, it is desired to generate codes of large size and large distance. A com...
The sequence design is a crucial problem in DNA based computation. We present results about tests ca...
<p>Results obtained by MA, PBS, DR, IBS and MPBS for protein instances in LargeRealSet. These are in...
<p>Figure shows evolution along execution time of statistical values (average and median) for relati...
<p>DNA barcode query identification success scores (%, N = 100) of six methods applied to barcode se...
<p>Time(.</p><p>Fourth column shows mean improvement of solutions obtained by MPBS with respect to t...
Conventional sequence alignment techniques for comparing and analysing relatively smaller DNA sequen...
Applying genetic algorithms to DNA sequence assembly is not a straightforward process. Significantly...
Abstract. Search for sequence similarity in large-scale databases of DNA and protein sequences is on...
Motivation: Several measures of DNA sequence dissimilarity have beendeveloped.Thepurposeof this pape...
The DNA restriction mapping problem can be abstracted to the Shortest Common Matching String problem...
Applying genetic algorithms to DNA sequence assem-bly is not a straightforward process. Significantl...
IEEE International Conference on Bioinformatics and Biomedicine (BIBM2010), 18-21 December, 2010, Ho...
Current common storage media has limited ability to store data with present data explosion trends, w...
The data provided here contains experimental results, all Matlab codes for statistical analysis and ...
Abstract. For DNA computing, it is desired to generate codes of large size and large distance. A com...
The sequence design is a crucial problem in DNA based computation. We present results about tests ca...
<p>Results obtained by MA, PBS, DR, IBS and MPBS for protein instances in LargeRealSet. These are in...
<p>Figure shows evolution along execution time of statistical values (average and median) for relati...
<p>DNA barcode query identification success scores (%, N = 100) of six methods applied to barcode se...
<p>Time(.</p><p>Fourth column shows mean improvement of solutions obtained by MPBS with respect to t...
Conventional sequence alignment techniques for comparing and analysing relatively smaller DNA sequen...
Applying genetic algorithms to DNA sequence assembly is not a straightforward process. Significantly...
Abstract. Search for sequence similarity in large-scale databases of DNA and protein sequences is on...
Motivation: Several measures of DNA sequence dissimilarity have beendeveloped.Thepurposeof this pape...
The DNA restriction mapping problem can be abstracted to the Shortest Common Matching String problem...
Applying genetic algorithms to DNA sequence assem-bly is not a straightforward process. Significantl...
IEEE International Conference on Bioinformatics and Biomedicine (BIBM2010), 18-21 December, 2010, Ho...
Current common storage media has limited ability to store data with present data explosion trends, w...
The data provided here contains experimental results, all Matlab codes for statistical analysis and ...
Abstract. For DNA computing, it is desired to generate codes of large size and large distance. A com...
The sequence design is a crucial problem in DNA based computation. We present results about tests ca...