Abstract The Smith–Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach was designed to reveal highly conserved fragments by discarding poorly initial and terminal segments. However, existing notion similarity has a serious flaw: it does not discard intermediate finds with maximal score but unable find maximum degree (e.g. percent matches). Moreover, there still no efficient...

Given strings S 1 , 2 and P, the constrained longest common subsequence problem for with respect to P is find a lcs of which contains as subsequence. We present an algorithm improves time complexity from previously known O(rn m ) O(rnm) where r, n, are lengths respectively. As generalization this, we extend definition so that sought whose edit distance less than given parameter d. For latter problem, propose O(drnm).

The work that established and explored the links between visual hierarchy conceptual ontology of firearms for purpose threat assessment is continued. previous study used geometrical information to find a target in through with derive high-level was assess potential threat. Multiple improvements new contributions are reported. theoretical basis geometric feature extraction method improved terms accuracy. sample space validations expanded from 31 153 firearms. Thus, larger more accurate...

As technological advancements continue to revolutionise the realm of education, use technology in both K-12 and university classrooms paves way for making flipped classroom a trending pedagogical model. Flipping course simply means reversing traditional model in-class lecture followed by practice homework. Research has shown that holds promise students' success satisfaction as long curricular activities are designed sequenced through some steps depending on tenets nature well principles...

A classical algorithm for the pairwise sequence alignment is Smith Waterman which uses dynamic programming. The computes maximum score of alignments that use insertions, deletions, and substitutions, with no consideration given in composition alignments. However, biologists favor applying their knowledge about common structures or functions into process. For protein sequences, several methods have been suggested taking account motifs (a restricted regular expression) from PROSITE database to...

A common model for computing the similarity of two strings X and Y lengths m, n respectively with m/spl ges/n, is to transform into through a sequence three types edit operations: insertion, deletion, substitution. The assumes given cost function which assigns non-negative real weight each operation. amortized ratio its length, minimum this over all sequences normalized distance. Existing algorithms distance computation proven complexity bounds require O(mn/sup 2/) time in worst-case. We...

This paper presents an approach to identify a weapon from single image using ontology. Ontological nodes selected by experts store convex hull (CH) sequences for their descendants, whereas the ontological leafs are labeled with object boundary sequences. The latter generated vertices, while CH objects' CHs. object's and extracted active contour model. Ontology search is performed top-down cyclic sequence alignment, which provides scaling rotational invariant matching. Experimental results...

Frequent pattern mining from sequences is a crucial step for many domain experts, such as molecular biologists, to discover rules or patterns hidden in their data. In order find specific patterns, existing tools require users specify gap constraints beforehand. reality, it often nontrivial let user provide constraints. addition, change made the values may give completely different results, and separate time-consuming re-mining procedure. Consequently desirable develop an algorithm...

The present work is a part of larger project on recognizing and identifying weapons from single image assessing threats in public places. Methods populating the weapon ontology have been shown. A clustering-based approach constructing visual hierarchies base extracted geometric features has proposed. convergence sequence hierarchy trees to conceptual tree discussed. For illustrative purposes, growing ontology, chosen as point for trees. new defined, Gonzalez' algorithm, generate hierarchies....

Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an database can be stored into a suffix array. A fast substructure search algorithm been based on binary this Using algorithm, we present that finds the largest common of given multiple structures in [Formula: text] format. The comparison problem is NP-hard its general formulation. We introduced new for comparing structures. This more strict similarity...

In this study, issues of validity and reliability a wide range instruments used to measure technological pedagogical content knowledge level English teachers were discussed. To end, the search in databases ERIC, ScienceDirect, Scopus, EBSCOhost, Web Science was conducted. As result applying set criteria publications retrieved from databases, 60 studies (including 40 articles, 14 dissertations 6 conference papers) found suitable for analysis current study. A two-level First one study-level...

In the present paper we study problem of weapon identification and threat assessment from a single image with partially occluded weapon. This poses very severe restrictions. To successfully identify its parts extend first firearm ontology meronymic (partonomic) principle which lets us distinguish gun (e.g., lock, barrel, stock, scope). Adding classes information provides meta-data (necessary for assessment) allows fast accurate search. Searching is treated conceptually as searching sum...

We propose a parallel algorithm for the constrained multiple sequence alignment (CMSA) problem that seeks an optimal to include given pattern. consider dynamic programming computations in layers indexed by symbols of In each layer we compute as potential part CMSA problem, shortest paths sources and destinations. These problems are independent from one another (which enables execution), can be solved using A* specialized The final step our solves single source destination path problem. Our...

Constrained sequence alignment has been proposed as a way for incorporating biologists' knowledge about common structures or functions into the process. For of protein sequences, several studies have suggested taking account motifs (a restricted regular expression) from PROSITE database to guide alignments. The expression constrained introduced this purpose. An satisfies constraint if part it matches given in each dimension (i.e. aligned). There is method that rewards alignments include...

In our rapidly growing and globalized world, the importance attached to teaching of foreign languages is increasing day by day. One most pressing examples it framework developed Council Europe. Considering needs priorities member countries, proposed Common European Framework Reference for Languages, a basic which they can resort in all stages language learning teaching. this paper, after explaining shortly definition, purposes required competencies framework, studies carried out world Turkey...