Search Results - (( sequence optimization method algorithm ) OR ( using optimization techniques algorithm ))
Search alternatives:
- optimization techniques »
- method algorithm »
-
1
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Article -
2
Product assembly sequence optimization based on genetic algorithm
Published 2010“…Genetic algorithm (GA) is a search technique used in computing to find approximate solution to optimization and search problem based on the theory of natural selection. …”
Get full text
Get full text
Get full text
Article -
3
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Student Project -
4
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
5
Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article
Published 2012“…back system for Smith-Waterman Algorithm using Structural Modelling Technique. The objectives for this paper are to optimize the best trace back scanning performance and also to design the simple architecture in order to reduce the runtime. …”
Get full text
Get full text
Article -
6
Multilevel optimization for dense motion estimation
Published 2011“…We evaluated the performance of different optimization techniques developed in the context of optical flow computation with different variational models.In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we developed the use of efficient multilevel schemes for computing the optical flow.More precisely, we evaluated the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/Opt), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/Opt).The FMG/Opt algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. …”
Get full text
Get full text
Get full text
Monograph -
7
Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri
Published 2018“…Thus, this research concentrates on the optimization techniques based on Custom Instruction (CI) and Rectangular Dimensional array (2D) that proposed on Smith-Waterman (SW) algorithm. …”
Get full text
Get full text
Thesis -
8
Optimal input shaping for vibration control of a flexible manipulator using genetic algorithm
Published 2005“…This thesis presents optimization of input shaping technique for vibration control of a flexible robot manipulator using genetic algorithms (GA). …”
Get full text
Get full text
Thesis -
9
Optimized tree-classification algorithm for classification of protein sequences
Published 2016“…In this work, we have proposed an optimized tree-classification technique which uses cluster k nearest neighbor classification algorithm to classify protein sequences into superfamilies. …”
Get full text
Get full text
Conference or Workshop Item -
10
Optimized tree-classification algorithm for classification of protein sequences
Published 2016“…In this work, we have proposed an optimized tree-classification technique which uses cluster k nearest neighbor classification algorithm to classify protein sequences into superfamilies. …”
Get full text
Get full text
Conference or Workshop Item -
11
A New Hybrid Image Encryption Technique Using Lorenz Chaotic System and Simulated Kalman Filter (SKF) Algorithm
Published 2022“…Nowadays, encryption is one of the most popular and effective security methods used by company and organizations. A new hybrid technique, Lorenz chaotic system and an optimization algorithm, Simulated Kalman Filter (SKF) had been proposed to solve image encryption problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Design and analysis of high performance and low power matrix filling for DNA sequence alignment accelerator using ASIC design flow: article
Published 2009“…The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smitt Waterman (SW) algorithm. …”
Get full text
Get full text
Article -
13
An improved particle swarm optimization algorithm for data classification
Published 2023“…Particle Swarm Optimization (PSO) is a metaheuristic algorithm based on swarm intelligence, widely used to solve global optimisation problems throughout the real world. …”
Get full text
Get full text
Get full text
Article -
14
Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod
“…The scope of this paper is to optimize the DNA sequences alignment on the matrix rilling module by implementing a parallel method of the Smith-Waterman algorithm. …”
Get full text
Get full text
Article -
15
Optimality of bus-invert coding
Published 2009“…While the method appears to be a greedy algorithm, we show that it is, in fact, an optimal strategy. …”
Get full text
Get full text
Article -
16
Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.]
Published 2012“…Specifically, the research objectives are i) to study various DNA sequences alignment algorithms characteristics, architectures and techniques such as scoring functions, optimal alignment and gap; and ii) to investigate the potential of data minimization approach in minimizing the size of data towards discovering the region of similarity in DNA sequences alignment and comparison and iii) to analyze the optimal sequences alignment properties for molecular biology and bioinformatics application. …”
Get full text
Get full text
Research Reports -
17
Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using ASIC design flow / Nurzaima Mahmod
Published 2010“…The scope of this paper is to optimize the DNA sequences alignment on the matrix filling module by implementing a parallel method of the SmithWaterman algorithm. …”
Get full text
Get full text
Thesis -
18
Computational Technique for an Efficient Classification of Protein Sequences With Distance-Based Sequence Encoding Algorithm
Published 2017“…The major problems in classifying protein sequences into existing families/superfamilies are the following: the selection of a suitable sequence encoding method, the extraction of an optimized subset of features that possesses significant discriminatory information, and the adaptation of an appropriate learning algorithm that classifies protein sequences with higher classification accuracy. …”
Get full text
Get full text
Article -
19
Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence
Published 2011“…In order to develop the proposed methods, the baseline techniques are studied to develop the proposed algorithms. …”
Get full text
Get full text
Get full text
Book Chapter -
20
Design and analysis of high performance and low power matrix filling for DNA sequence allignment accelerator using ASIC design flow / Nurul Farhana Abd Razak
Published 2010“…The objective of this paper is to improve the performance of the DNA sequence alignment and to optimize power reduction of the existing technique by using Smith Waterman (SW) algorithm. …”
Get full text
Get full text
Student Project
