%0 Conference Paper %1 conf/fcs/WeemsB05 %A Weems, Bob P. %A Bai, Yongsheng %B FCS %D 2005 %E Arabnia, Hamid R. %E Joshua, Rose %I CSREA Press %K dblp %P 64-72 %T Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences. %U http://dblp.uni-trier.de/db/conf/fcs/fcs2005.html#WeemsB05 %@ 1-932415-71-8

@inproceedings{conf/fcs/WeemsB05, added-at = {2006-02-15T00:00:00.000+0100}, author = {Weems, Bob P. and Bai, Yongsheng}, biburl = {https://www.bibsonomy.org/bibtex/2f838618a171829d7c28076c528617ad2/dblp}, booktitle = {FCS}, crossref = {conf/fcs/2005}, date = {2006-02-15}, description = {dblp}, editor = {Arabnia, Hamid R. and Joshua, Rose}, interhash = {a7fd183c0e5cba6a6ef57df49dc0855e}, intrahash = {f838618a171829d7c28076c528617ad2}, isbn = {1-932415-71-8}, keywords = {dblp}, pages = {64-72}, publisher = {CSREA Press}, timestamp = {2006-02-15T00:00:00.000+0100}, title = {Finding Longest Common Increasing Subsequence for Two Different Scenarios of Non-random Input Sequences.}, url = {http://dblp.uni-trier.de/db/conf/fcs/fcs2005.html#WeemsB05}, year = 2005 }