Loading...
Search for: sequence-alignment
0.005 seconds
Total 21 records

    Optical pattern generator for efficient bio-data encoding in a photonic sequence comparison architecture

    , Article PloS one ; Volume 16, Issue 1 , 2021 , Pages e0245095- ; 19326203 (ISSN) Akbari Rokn Abadi, S ; Hashemi Dijujin, N ; Koohi, S ; Sharif University of Technology
    NLM (Medline)  2021
    Abstract
    In this study, optical technology is considered as SA issues' solution with the potential ability to increase the speed, overcome memory-limitation, reduce power consumption, and increase output accuracy. So we examine the effect of bio-data encoding and the creation of input images on the pattern-recognition error-rate at the output of optical Vander-lugt correlator. Moreover, we present a genetic algorithm-based coding approach, named as GAC, to minimize output noises of cross-correlating data. As a case study, we adopt the proposed coding approach within a correlation-based optical architecture for counting k-mers in a DNA string. As verified by the simulations on Salmonella whole-genome,... 

    Optical pattern generator for efficient bio-data encoding in a photonic sequence comparison architecture

    , Article PloS one ; Volume 16, Issue 1 , 2021 , Pages e0245095- ; 19326203 (ISSN) Akbari Rokn Abadi, S ; Hashemi Dijujin, N ; Koohi, S ; Sharif University of Technology
    NLM (Medline)  2021
    Abstract
    In this study, optical technology is considered as SA issues' solution with the potential ability to increase the speed, overcome memory-limitation, reduce power consumption, and increase output accuracy. So we examine the effect of bio-data encoding and the creation of input images on the pattern-recognition error-rate at the output of optical Vander-lugt correlator. Moreover, we present a genetic algorithm-based coding approach, named as GAC, to minimize output noises of cross-correlating data. As a case study, we adopt the proposed coding approach within a correlation-based optical architecture for counting k-mers in a DNA string. As verified by the simulations on Salmonella whole-genome,... 

    FAME: fast and memory efficient multiple sequences alignment tool through compatible chain of roots

    , Article Bioinformatics ; Volume 36, Issue 12 , 15 June , 2020 , Pages 3662-3668 Etminan, N ; Parvinnia, E ; Sharifi Zarchi, A ; Sharif University of Technology
    Oxford University Press  2020
    Abstract
    Motivation: Multiple sequence alignment (MSA) is important and challenging problem of computational biology. Most of the existing methods can only provide a short length multiple alignments in an acceptable time. Nevertheless, when the researchers confront the genome size in the multiple alignments, the process has required a huge processing space/time. Accordingly, using the method that can align genome size rapidly and precisely has a great effect, especially on the analysis of the very long alignments. Herein, we have proposed an efficient method, called FAME, which vertically divides sequences from the places that they have common areas; then they are arranged in consecutive order. Then... 

    A new multiple dna and protein sequences alignment method based on evolutionary algorithms

    , Article Journal of Knowledge and Health in Basic Medical Sciences ; Volume 16, Issue 1 , 2021 , Pages 13-20 ; 1735577X (ISSN) Etminan, N ; Parvinnia, E ; Sharifi Zarchi, A ; Sharif University of Technology
    Shahroud University of Medical Sciences  2021
    Abstract
    Introduction: The study of life and the detection of gene functions is an important issue in biological science. Multiple sequences alignment methods measure the similarity of DNA sequences. Nonetheless, when the size of genome sequences is increased, we encounter with the lack of memory and increasing the run time. Therefore, a fast method with a suitable accuracy for genome alignment has a significant impact on the analysis of long sequences. Methods: We introduce a new method in which, it first divides each sequence into short sequences. Then, it uses evolutionary algorithms to align the sequences. Results: The proposed method has been evaluated in seven datasets with different number of... 

    An accurate alignment-free protein sequence comparator based on physicochemical properties of amino acids

    , Article Scientific Reports ; Volume 12, Issue 1 , 2022 ; 20452322 (ISSN) Akbari Rokn Abadi, S ; Abdosalehi, A. S ; Pouyamehr, F ; Koohi, S ; Sharif University of Technology
    Nature Research  2022
    Abstract
    Bio-sequence comparators are one of the most basic and significant methods for assessing biological data, and so, due to the importance of proteins, protein sequence comparators are particularly crucial. On the other hand, the complexity of the problem, the growing number of extracted protein sequences, and the growth of studies and data analysis applications addressing protein sequences have necessitated the development of a rapid and accurate approach to account for the complexities in this field. As a result, we propose a protein sequence comparison approach, called PCV, which improves comparison accuracy by producing vectors that encode sequence data as well as physicochemical properties... 

    HELIOS: High-speed sequence alignment in optics

    , Article PLoS Computational Biology ; Volume 18, Issue 11 , 2022 ; 1553734X (ISSN) Maleki, E ; Akbari Rokn Abadi, S ; Koohi, S ; Sharif University of Technology
    Public Library of Science  2022
    Abstract
    In response to the imperfections of current sequence alignment methods, originated from the inherent serialism within their corresponding electrical systems, a few optical approaches for biological data comparison have been proposed recently. However, due to their low performance, raised from their inefficient coding scheme, this paper presents a novel all-optical high-throughput method for aligning DNA, RNA, and protein sequences, named HELIOS. The HELIOS method employs highly sophisticated operations to locate character matches, single or multiple mutations, and single or multiple indels within various biological sequences. On the other hand, the HELIOS optical architecture exploits... 

    NETAL: A new graph-based method for global alignment of protein-protein interaction networks

    , Article Bioinformatics ; Volume 29, Issue 13 , 2013 , Pages 1654-1662 ; 13674803 (ISSN) Neyshabur, B ; Khadem, A ; Hashemifar, S ; Arab, S. S ; Sharif University of Technology
    2013
    Abstract
    Motivation: The interactions among proteins and the resulting networks of such interactions have a central role in cell biology. Aligning these networks gives us important information, such as conserved complexes and evolutionary relationships. Although there have been several publications on the global alignment of protein networks; however, none of proposed methods are able to produce a highly conserved and meaningful alignment. Moreover, time complexity of current algorithms makes them impossible to use for multiple alignment of several large networks together.Results: We present a novel algorithm for the global alignment of protein-protein interaction networks. It uses a greedy method,... 

    High-speed all-optical DNA local sequence alignment based on a three-dimensional artificial neural network

    , Article Journal of the Optical Society of America A: Optics and Image Science, and Vision ; Volume 34, Issue 7 , 2017 , Pages 1173-1186 ; 10847529 (ISSN) Maleki, E ; Babashah, H ; Koohi, S ; Kavehvash, Z ; Sharif University of Technology
    OSA - The Optical Society  2017
    Abstract
    This paper presents an optical processing approach for exploring a large number of genome sequences. Specifically, we propose an optical correlator for global alignment and an extended moiré matching technique for local analysis of spatially coded DNA, whose output is fed to a novel three-dimensional artificial neural network for local DNA alignment. All-optical implementation of the proposed 3D artificial neural network is developed and its accuracy is verified in Zemax. Thanks to its parallel processing capability, the proposed structure performs local alignment of 4 million sequences of 150 base pairs in a few seconds, which is much faster than its electrical counterparts, such as the... 

    A new genetic algorithm for multiple sequence alignment

    , Article International Journal of Computational Intelligence and Applications ; Volume 11, Issue 4 , December , 2012 ; 14690268 (ISSN) Narimani, Z ; Beigy, H ; Abolhassani, H ; Sharif University of Technology
    2012
    Abstract
    Multiple sequence alignment (MSA) is one of the basic and important problems in molecular biology. MSA can be used for different purposes including finding the conserved motifs and structurally important regions in protein sequences and determine evolutionary distance between sequences. Aligning several sequences cannot be done in polynomial time and therefore heuristic methods such as genetic algorithms can be used to find approximate solutions of MSA problems. Several algorithms based on genetic algorithms have been developed for this problem in recent years. Most of these algorithms use very complicated, problem specific and time consuming mutation operators. In this paper, we propose a... 

    Applying sequence alignment in tracking evolving clusters of web-sessions data: An artificial immune network approach

    , Article Proceedings - 3rd International Conference on Computational Intelligence, Communication Systems and Networks, CICSyN 2011, 26 July 2011 through 28 July 2011, Bali ; 2011 , Pages 42-47 ; 9780769544823 (ISBN) Azimpour Kivi, M ; Azmi, R ; Sharif University of Technology
    2011
    Abstract
    Artificial Immune System (AIS) models have outstanding properties, such as learning, adaptivity and robustness, which make them suitable for learning in dynamic and noisy environments such as the web. In this study, we tend to apply AIS for tracking evolving patterns of web usage data. The definition of the similarity of web sessions has an important impact on the quality of discovered patterns. Many prevalent web usage mining approaches ignore the sequential nature of web navigations for defining similarity between sessions. We propose the use of a new web sessions' similarity measure for investigating the usage data from web access log files. In this similarity measure, in addition to the... 

    Speeding up DNA sequence alignment by optical correlator

    , Article Optics and Laser Technology ; Volume 108 , 2018 , Pages 124-135 ; 00303992 (ISSN) Mozafari, F ; Babashah, H ; Koohi, S ; Kavehvash, Z ; Sharif University of Technology
    Elsevier Ltd  2018
    Abstract
    In electronic computers, extensive amount of computations required for searching biological sequences in big databases leads to vast amount of energy consumption for electrical processing and cooling. On the other hand, optical processing is much faster than electrical counterpart, due to its parallel processing capability, at a fraction of energy consumption level and cost. In this regard, this paper proposes a correlation-based optical algorithm using metamaterial, taking advantages of optical parallel processing, to efficiently locate the edits as a means of DNA sequence comparison. Specifically, the proposed algorithm partitions the read DNA sequence into multiple overlapping intervals,... 

    OptCAM: An ultra-fast all-optical architecture for DNA variant discovery

    , Article Journal of Biophotonics ; Volume 13, Issue 1 , August , 2020 Maleki, E ; Koohi, S ; Kavehvash, Z ; Mashaghi, A ; Sharif University of Technology
    Wiley-VCH Verlag  2020
    Abstract
    Nowadays, the accelerated expansion of genetic data challenges speed of current DNA sequence alignment algorithms due to their electrical implementations. Essential needs of an efficient and accurate method for DNA variant discovery demand new approaches for parallel processing in real time. Fortunately, photonics, as an emerging technology in data computing, proposes optical correlation as a fast similarity measurement algorithm; while complexity of existing local alignment algorithms severely limits their applicability. Hence, in this paper, employing optical correlation for global alignment, we present an optical processing approach for local DNA sequence alignment to benefit both... 

    Design & Analysis of a DNA String Matching System Based on Optical Parallel Processing

    , M.Sc. Thesis Sharif University of Technology Babashah, Hossein (Author) ; Kavehvash, Zahra (Supervisor) ; Koohi, Somaie (Co-Advisor) ; Khavasi, Amin (Co-Advisor)
    Abstract
    In recent years, the biological evolution of molecular detection capabilities based on gene analysis has provided a reliable performance in the diagnosis of a disease before a symptom emerges. Human gene storage requires a large amount of computer memory (about 1.5 GB for each DNA) and the search for a specific pattern within it with electronic computers is time and power consuming. Optical computing uses light parallel processing capabilities to find the pattern in a digital field, which can be used to process large volumes of data in short time and low power consumption, while electronic computers process data in series with high power dissipation. According to the Optalysys report, the... 

    A webpage similarity measure for web sessions clustering using sequence alignment

    , Article 2011 International Symposium on Artificial Intelligence and Signal Processing, AISP 2011, 15 June 2011 through 16 June 2011 ; June , 2011 , Pages 20-24 ; 9781424498345 (ISBN) Azimpour Kivi, M ; Azmi, R ; Sharif University of Technology
    2011
    Abstract
    Web sessions clustering is a process of web usage mining task that aims to group web sessions with similar trends and usage patterns into clusters. This process is crucial for effective website management, web personalization and developing web recommender systems. Accurate clustering of web sessions is highly dependent to the similarity measure defined to compare web sessions. In this paper, we propose a similarity measure for comparing web sessions. The sequential order of web navigations in sessions is considered using sequence alignment method. Furthermore, we propose to consider the usage similarity of two web sessions based on the time a user spends on a webpage, and also the frequency... 

    Design and Analysis of DNA Sequencing Methods

    , Ph.D. Dissertation Sharif University of Technology Nashtaali, Damoun (Author) ; Hossein Khalaj, Babak (Supervisor) ; Abolfazl, Motahhari (Co-Advisor)
    Abstract
    A DNA sequence is the information source of living kinds. Information of this sequence is at its constructing bases which has four different kinds. Sequencing DNA is necessary to resolve this information. At 1977, Sanger reported the first sequence of a DNA string. Recently, a human DNA string can be sequenced with 1000 in ~2 hours. Knowing DNA sequence helps to find function of each organism, predict and cure diseases (especially in cancer). Next Generation Sequencing (NGS) methods are based on shot-gun sequencing which fragmentize DNA strings and sequence each fragment. After sequencing, processing information of DNA is performed by the processing machine in two different types: alignment... 

    Design and Implementation of DNA Pattern Recognition Algorithm Utilizing Optical Coding Method

    , M.Sc. Thesis Sharif University of Technology Maleki, Ehsan (Author) ; Koohi, Somayyeh (Supervisor) ; Kavehvash, Zahra (Supervisor)
    Abstract
    In this research, two novel optical methods have been proposed for DNA local sequence alignment. The proposed methods benefit from algorithms and methods in computer field and ability of parallelism in optical wave to achieve a low-cost process and propose an easy understanding output in DNA local sequence alignment procedure. The first method is built upon moiré matching technique which is extended by proposed HAPPOC scheme using amplitude, phase, and polarization of optical wave. For analyzing the extended moiré output, a novel 3D Artificial Neural Network is designed and developed by optical structure. The second structure, as named HAWPOD method, is based on DV-Curve method. The HAWPOD... 

    Meta-aligner: long-read alignment based on genome statistics

    , Article BMC Bioinformatics ; Volume 18, Issue 1 , 2017 ; 14712105 (ISSN) Nashta Ali, D ; Aliyari, A ; Ahmadian Moghadam, A ; Edrisi, M. A ; Motahari, S. A ; Khalaj, B. H ; Sharif University of Technology
    Abstract
    Background: Current development of sequencing technologies is towards generating longer and noisier reads. Evidently, accurate alignment of these reads play an important role in any downstream analysis. Similarly, reducing the overall cost of sequencing is related to the time consumption of the aligner. The tradeoff between accuracy and speed is the main challenge in designing long read aligners. Results: We propose Meta-aligner which aligns long and very long reads to the reference genome very efficiently and accurately. Meta-aligner incorporates available short/long aligners as subcomponents and uses statistics from the reference genome to increase the performance. Meta-aligner estimates... 

    IMOS: improved meta-aligner and minimap2 on spark

    , Article BMC Bioinformatics ; Volume 20, Issue 1 , 2019 ; 14712105 (ISSN) Hadadian Nejad Yousefi, M ; Goudarzi, M ; Motahari, A ; Sharif University of Technology
    BioMed Central Ltd  2019
    Abstract
    Background: Long reads provide valuable information regarding the sequence composition of genomes. Long reads are usually very noisy which renders their alignments on the reference genome a daunting task. It may take days to process datasets enough to sequence a human genome on a single node. Hence, it is of primary importance to have an aligner which can operate on distributed clusters of computers with high performance in accuracy and speed. Results: In this paper, we presented IMOS, an aligner for mapping noisy long reads to the reference genome. It can be used on a single node as well as on distributed nodes. In its single-node mode, IMOS is an Improved version of Meta-aligner (IM)... 

    You are what you eat: Sequence analysis reveals how plant microRNAs may regulate the human genome

    , Article Computers in Biology and Medicine ; Volume 106 , 2019 , Pages 106-113 ; 00104825 (ISSN) Kashani, B ; Hasani Bidgoli, M ; Motahari, S. A ; Sedaghat, N ; Modarressi, M. H ; Sharif University of Technology
    Elsevier Ltd  2019
    Abstract
    Background: Nutrigenomic has revolutionized our understanding of nutrition. As plants make up a noticeable part of our diet, in the present study we chose microRNAs of edible plants and investigated if they can perfectly match human genes, indicating potential regulatory functionalities. Methods: miRNAs were obtained using the PNRD database. Edible plants were separated and microRNAs in common in at least four of them entered our analysis. Using vmatchPattern, these 64 miRNAs went through four steps of refinement to improve target prediction: Alignment with the whole genome (2581 results), filtered for those in gene regions (1371 results), filtered for exon regions (66 results) and finally... 

    A tale of two symmetrical tails: Structural and functional characteristics of palindromes in proteins

    , Article BMC Bioinformatics ; Volume 9 , 2008 ; 14712105 (ISSN) Sheari, A ; Kargar, M ; Katanforoush, A ; Arab, S ; Sadeghi, M ; Pezeshk, H ; Eslahchi, C ; Marashi, S. A ; Sharif University of Technology
    2008
    Abstract
    Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible importance is incomplete. Results: In this work, we tried to revisit this relatively neglected phenomenon. Several questions are addressed in this work. (1) It is known that there is a large chance of finding a palindrome in low complexity sequences (i.e. sequences with extreme amino acid usage bias). What is the role of sequence complexity in the evolution of palindromic sequences in proteins? (2) Do palindromes coincide with conserved protein sequences? If yes, what are the functions of these conserved segments?...