An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/bmei/ParvinniaTZ08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/bmei/ParvinniaTZ08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Elham_Parvinnia
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Koorush_Ziarati
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mohammad_Taheri
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FBMEI.2008.212
>
foaf:
homepage
<
https://doi.org/10.1109/BMEI.2008.212
>
dc:
identifier
DBLP conf/bmei/ParvinniaTZ08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FBMEI.2008.212
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Elham_Parvinnia
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Koorush_Ziarati
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mohammad_Taheri
>
swrc:
pages
57-61
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/bmei/2008-1
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/bmei/ParvinniaTZ08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/bmei/ParvinniaTZ08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/bmei/bmei2008-1.html#ParvinniaTZ08
>
rdfs:
seeAlso
<
https://doi.org/10.1109/BMEI.2008.212
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/bmei
>
dc:
subject
Longest Common Subsequence (LCS), global alignment
(xsd:string)
dc:
title
An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document