A natural number based linear time filtering approach to finding all occurrences of a DNA pattern

String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task i...

Full description

Saved in:
Bibliographic Details
Main Author: Le, Vu Quang
Format: Conference Proceeding
Language:English
Subjects:
Computer science
DNA
Filtering
Frequency
Genetics
Matched filters
Nonlinear filters
Pattern matching
Sequences
Table lookup
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 137
container_issue
container_start_page 134
container_title
container_volume
creator Le, Vu Quang
description String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Θ( - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.
doi_str_mv 10.1109/ICISIP.2006.4286078
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4286078</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4286078</ieee_id><sourcerecordid>4286078</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-409fd1341370ec7ed21e46bff3b817e468e57e42243d391450ad00b2900d6ace3</originalsourceid><addsrcrecordid>eNo1UMtOwzAQNEJIQOkX9OIfaNm1nYePUXg0UgVIwLnaxBswSp3ISQ_8PRGUucxDmjmMECuEDSLY26qsXquXjQJIN0blKWT5mbhGo4yBFJU9F0ub5f8e8VIsx_ELZmibGKWuBBUy0HSM1MlwPNQcZU0jO9n5wBTl5A8sW99NHH34kDQMsafmU079nAb3m3Wd7JvmGCOHhkfZt5Lk3VMhB5rmWrgRFy11Iy9PvBDvD_dv5Xa9e36symK39pgl09qAbR1qgzoDbjJ2CtmkddvqOsdsljknMylltNMWTQLkAGplAVxKDeuFWP3tembeD9EfKH7vT6_oH-0xVfw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A natural number based linear time filtering approach to finding all occurrences of a DNA pattern</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Le, Vu Quang</creator><creatorcontrib>Le, Vu Quang</creatorcontrib><description>String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Θ( - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.</description><identifier>ISBN: 9781424406111</identifier><identifier>ISBN: 1424406110</identifier><identifier>EISBN: 1424406129</identifier><identifier>EISBN: 9781424406128</identifier><identifier>DOI: 10.1109/ICISIP.2006.4286078</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer science ; DNA ; Filtering ; Frequency ; Genetics ; Matched filters ; Nonlinear filters ; Pattern matching ; Sequences ; Table lookup</subject><ispartof>2006 Fourth International Conference on Intelligent Sensing and Information Processing, 2006, p.134-137</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4286078$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4286078$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Le, Vu Quang</creatorcontrib><title>A natural number based linear time filtering approach to finding all occurrences of a DNA pattern</title><title>2006 Fourth International Conference on Intelligent Sensing and Information Processing</title><addtitle>ICISIP</addtitle><description>String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Θ( - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.</description><subject>Computer science</subject><subject>DNA</subject><subject>Filtering</subject><subject>Frequency</subject><subject>Genetics</subject><subject>Matched filters</subject><subject>Nonlinear filters</subject><subject>Pattern matching</subject><subject>Sequences</subject><subject>Table lookup</subject><isbn>9781424406111</isbn><isbn>1424406110</isbn><isbn>1424406129</isbn><isbn>9781424406128</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1UMtOwzAQNEJIQOkX9OIfaNm1nYePUXg0UgVIwLnaxBswSp3ISQ_8PRGUucxDmjmMECuEDSLY26qsXquXjQJIN0blKWT5mbhGo4yBFJU9F0ub5f8e8VIsx_ELZmibGKWuBBUy0HSM1MlwPNQcZU0jO9n5wBTl5A8sW99NHH34kDQMsafmU079nAb3m3Wd7JvmGCOHhkfZt5Lk3VMhB5rmWrgRFy11Iy9PvBDvD_dv5Xa9e36symK39pgl09qAbR1qgzoDbjJ2CtmkddvqOsdsljknMylltNMWTQLkAGplAVxKDeuFWP3tembeD9EfKH7vT6_oH-0xVfw</recordid><startdate>200612</startdate><enddate>200612</enddate><creator>Le, Vu Quang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200612</creationdate><title>A natural number based linear time filtering approach to finding all occurrences of a DNA pattern</title><author>Le, Vu Quang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-409fd1341370ec7ed21e46bff3b817e468e57e42243d391450ad00b2900d6ace3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Computer science</topic><topic>DNA</topic><topic>Filtering</topic><topic>Frequency</topic><topic>Genetics</topic><topic>Matched filters</topic><topic>Nonlinear filters</topic><topic>Pattern matching</topic><topic>Sequences</topic><topic>Table lookup</topic><toplevel>online_resources</toplevel><creatorcontrib>Le, Vu Quang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Le, Vu Quang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A natural number based linear time filtering approach to finding all occurrences of a DNA pattern</atitle><btitle>2006 Fourth International Conference on Intelligent Sensing and Information Processing</btitle><stitle>ICISIP</stitle><date>2006-12</date><risdate>2006</risdate><spage>134</spage><epage>137</epage><pages>134-137</pages><isbn>9781424406111</isbn><isbn>1424406110</isbn><eisbn>1424406129</eisbn><eisbn>9781424406128</eisbn><abstract>String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Θ( - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.</abstract><pub>IEEE</pub><doi>10.1109/ICISIP.2006.4286078</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424406111
ispartof 2006 Fourth International Conference on Intelligent Sensing and Information Processing, 2006, p.134-137
issn
language eng
recordid cdi_ieee_primary_4286078
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer science
DNA
Filtering
Frequency
Genetics
Matched filters
Nonlinear filters
Pattern matching
Sequences
Table lookup
title A natural number based linear time filtering approach to finding all occurrences of a DNA pattern
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-23T17%3A49%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20natural%20number%20based%20linear%20time%20filtering%20approach%20to%20finding%20all%20occurrences%20of%20a%20DNA%20pattern&rft.btitle=2006%20Fourth%20International%20Conference%20on%20Intelligent%20Sensing%20and%20Information%20Processing&rft.au=Le,%20Vu%20Quang&rft.date=2006-12&rft.spage=134&rft.epage=137&rft.pages=134-137&rft.isbn=9781424406111&rft.isbn_list=1424406110&rft_id=info:doi/10.1109/ICISIP.2006.4286078&rft.eisbn=1424406129&rft.eisbn_list=9781424406128&rft_dat=%3Cieee_6IE%3E4286078%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-409fd1341370ec7ed21e46bff3b817e468e57e42243d391450ad00b2900d6ace3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4286078&rfr_iscdi=true