%0 Conference Paper %1 conf/bmei/ParvinniaTZ08 %A Parvinnia, Elham %A Taheri, Mohammad %A Ziarati, Koorush %B BMEI (1) %D 2008 %I IEEE Computer Society %K dblp %P 57-61 %T An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences. %U http://dblp.uni-trier.de/db/conf/bmei/bmei2008-1.html#ParvinniaTZ08 %@ 978-0-7695-3118-2

@inproceedings{conf/bmei/ParvinniaTZ08, added-at = {2024-02-05T00:00:00.000+0100}, author = {Parvinnia, Elham and Taheri, Mohammad and Ziarati, Koorush}, biburl = {https://www.bibsonomy.org/bibtex/262cd83e7253008752e73a7990f8ad3eb/dblp}, booktitle = {BMEI (1)}, crossref = {conf/bmei/2008-1}, ee = {https://doi.ieeecomputersociety.org/10.1109/BMEI.2008.212}, interhash = {e5cb66e58a9aa6f63262206bec0388ec}, intrahash = {62cd83e7253008752e73a7990f8ad3eb}, isbn = {978-0-7695-3118-2}, keywords = {dblp}, pages = {57-61}, publisher = {IEEE Computer Society}, timestamp = {2024-04-09T21:22:53.000+0200}, title = {An Improved Longest Common Subsequence Algorithm for Reducing Memory Complexity in Global Alignment of DNA Sequences.}, url = {http://dblp.uni-trier.de/db/conf/bmei/bmei2008-1.html#ParvinniaTZ08}, year = 2008 }