Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorKim, Min-Ah
dc.contributor.authorLee, Eun-Jeong
dc.contributor.authorCho, Hwan-Gue
dc.contributor.authorPark, Kie-Jung
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-23T11:41:36Z
dc.date.available2015-09-23T11:41:36Z
dc.date.issued1997
dc.identifier.citationJournal of WSCG. 1997, vol. 5, no. 1-3, p. 212-221.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://wscg.zcu.cz/wscg1997/wscg97.htm
dc.identifier.urihttp://hdl.handle.net/11025/15898
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectvizualizacecs
dc.subjectDNA homologiecs
dc.subjectk-convex sloupcový algoritmuscs
dc.titleA visualization technique for DNA walk plot using k-convex hullen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedIn this paper we propose a new visualization technique to characterize qualitative information of a large DNA sequence. While a long DNA sequence has huge information, it is not easy to obtain genetic information from the DNA sequence visually. We transform DNA sequences into polygons to compute their homology in image domain rather than text domain. Our program visualizes DNA sequences with colored walk plots and simplify them into k-convex polygons. A walk plot represents a DNA sequence as a curve in a plane. A k-convex polygon simplifies a walk plot by removing some parts of insignificant information of a walk plot. This technique gives a biologist an insight to detect and classify a group of homologous DNA sequences. Experiments with real genomic data proves our approach shows good visual forms for long DNA sequences for homology analysis.en
dc.subject.translatedvisualizationen
dc.subject.translatedDNA homologyen
dc.subject.translatedk-convex hull algorithmen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 5, number 1-3 (1997)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Kim_97.pdfPlný text1,09 MBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/15898

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.