1 December 2013 in Journal of Biomedical Informatics
27 September 2013 in Empirical Software Engineering
Completeness is one of the main quality attributes of requirements specifications. If functional requirements are expressed as use cases, one can be interested in event completeness. A use case is event complete if it contains description of all the events that can happen when executing the use case. Missing events in any use case can lead to higher project costs. Thus, the question arises of what is a good method of identification of events in use cases and what accuracy and review speed one can expect from it. The goal of this study was to check if (1) HAZOP-based event identification is more effective than ad hoc review and (2) what is the review speed of these two approaches. Two controlled experiments were conducted in order to evaluate ad hoc approach and H4U method to event identification. The first experiment included 18 students, while the second experiment was conducted with the help of 82 professionals. In both cases, accuracy and review speed of the investigated methods were measured and analyzed. Moreover, the usage of HAZOP keywords was analyzed. In both experiments, a benchmark specification based on use cases was used. The first experiment with students showed that a HAZOP-based review is more effective in event identification than ad hoc review and this result is statistically significant. However, the reviewing speed of HAZOP-based reviews is lower. The second experiment with professionals confirmed these results. These experiments showed also that event completeness is hard to achieve. It on average ranged from 0.15 to 0.26. HAZOP-based identification of events in use cases is an useful alternative to ad hoc reviews. It can achieve higher event completeness at the cost of an increase in effort.
1 September 2013 in Discrete Applied Mathematics
27 April 2010 in RAIRO - Operations Research
Determining amino acid sequences of protein molecules is one of the most important issues in molecular biology. These sequences determine protein structure and functionality. Unfortunately, direct biochemical methods for reading amino acid sequences can be used for reading short sequences only. This is the reason, which makes peptide assembly algorithms an important complement of these methods. In this paper, a genetic algorithm solving the problem of short amino acid sequence assembly is presented. The algorithm has been tested in computational experiment and compared with an existing tabu search method for the same problem. The results clearly show that the genetic algorithm outperformed the tabu search approach.
1 April 2019 in Discrete Applied Mathematics
26 March 2018 in Current Bioinformatics
Background: Peptides are chemicals built of 20 types of amino acids linked into long chain called sequence. Determination of amino acid sequence (order) in peptide is a very important issue of modern molecular biology. There is no direct chemical method that allows determining long peptide sequences. The approach to do so is to cut long sequence into short pieces, sequence them and then to figure out what was their order in the original long sequence (proper order determines long sequence). This process is called assembly and requires applying computational methods. In this paper, we present dedicated heuristic for strongly NP-hard variant of peptide assembly problem. Objective: The objective of the research was to propose a new method for peptide assembly problem. There are a few metaheuristic methods available in the literature, however their results (similarity of computed sequence compare to original one) are not good enough to be considered for practical use. The main goal was to design dedicated heuristic that takes into account problem properties and finally leads to better results. Method: The considered variant of the peptide assembly problem was formulated using graph theory. For metaheuristic methods available in the literature, a special variant of Hamiltonian problem had to be solved to find the final peptide sequence. For dedicated heuristic, instead of looking for the special variant of Hamiltonian path in this graph, the family of its sub-graphs (called adjoints) is searched for the Hamiltonian path. The space of acceptable solutions that need to be searched to find the optimal solution was strongly decreased in comparison to metaheuristic methods. Results: The computational experiment has been performed to test dedicated heuristic and the obtained results strongly exceed results of methods (solving this problem) which are available in the literature. The average result for the new dedicated heuristic is 96.07% compared to 59,7% for Tabu Search, 72,32% for GRASP and 88,74% for evolutionary algorithm. Conclusion: The obtained results clearly show that the new dedicated heuristic is much more useful in the process of peptide sequence determination.