Identification of DNA Motif with Mutation

The conventional way of identifying possible motif sequences in a DNA strand is to use representative scalar weight matrix for searching good match substring alignments. However, this approach, solely based on match alignment information, is susceptible to a high number of ambiguous sites or false p...

Full description

Saved in:
Bibliographic Details
Main Author: Shu, Jian-Jun
Other Authors: School of Mechanical and Aerospace Engineering
Format: Article
Language:English
Published: 2015
Subjects:
Online Access:https://hdl.handle.net/10356/81178
http://hdl.handle.net/10220/39172
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-81178
record_format dspace
spelling sg-ntu-dr.10356-811782023-03-04T17:13:56Z Identification of DNA Motif with Mutation Shu, Jian-Jun School of Mechanical and Aerospace Engineering DNA coding; Scoring matrix; Sequence analysis The conventional way of identifying possible motif sequences in a DNA strand is to use representative scalar weight matrix for searching good match substring alignments. However, this approach, solely based on match alignment information, is susceptible to a high number of ambiguous sites or false positives if the motif sequences are not well conserved. A significant amount of time is then required to verify these sites for the suggested motifs. Hence in this paper, the use of mismatch alignment information in addition to match alignment information for DNA motif searching is proposed. The objective is to reduce the number of ambiguous false positives encountered in the DNA motif searching, thereby making the process more efficient for biologists to use. Published version 2015-12-18T07:33:29Z 2019-12-06T14:23:03Z 2015-12-18T07:33:29Z 2019-12-06T14:23:03Z 2015 Journal Article Shu, J.-J. (2015). Identification of DNA Motif with Mutation. Procedia Computer Science, 51, 602-609. 1877-0509 https://hdl.handle.net/10356/81178 http://hdl.handle.net/10220/39172 10.1016/j.procs.2015.05.328 en Procedia Computer Science © 2015 The Author. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. 8 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DNA coding; Scoring matrix; Sequence analysis
spellingShingle DNA coding; Scoring matrix; Sequence analysis
Shu, Jian-Jun
Identification of DNA Motif with Mutation
description The conventional way of identifying possible motif sequences in a DNA strand is to use representative scalar weight matrix for searching good match substring alignments. However, this approach, solely based on match alignment information, is susceptible to a high number of ambiguous sites or false positives if the motif sequences are not well conserved. A significant amount of time is then required to verify these sites for the suggested motifs. Hence in this paper, the use of mismatch alignment information in addition to match alignment information for DNA motif searching is proposed. The objective is to reduce the number of ambiguous false positives encountered in the DNA motif searching, thereby making the process more efficient for biologists to use.
author2 School of Mechanical and Aerospace Engineering
author_facet School of Mechanical and Aerospace Engineering
Shu, Jian-Jun
format Article
author Shu, Jian-Jun
author_sort Shu, Jian-Jun
title Identification of DNA Motif with Mutation
title_short Identification of DNA Motif with Mutation
title_full Identification of DNA Motif with Mutation
title_fullStr Identification of DNA Motif with Mutation
title_full_unstemmed Identification of DNA Motif with Mutation
title_sort identification of dna motif with mutation
publishDate 2015
url https://hdl.handle.net/10356/81178
http://hdl.handle.net/10220/39172
_version_ 1759856273569873920