|  MAIER D.The complexity of some problem on subsequencesand superseuqences[J].Journal of the ACM (JACM), 1978,25 (2):322-366.
 BERGROTH L,HAKONEN H,RAITA T.A survey of longest common subsequence algorithms[C]∥Processings.Seventh International Symposium on String Processing and Information Retrieval,2000(SPIRE 2000).IEEE,2000:39-48.
 ATTWOOD T,FINDLAY J.Fingerprinting g-protein-coupledreceptors[J].Protein engineering,1994,7(2):195-203.
 SANKOFF D,BLANCHETTE M.Phylogenetic invariants forgenome rearrangements[J].Journal of Computational Biology,1999,6(3/4):431-445.
 SHUKLA A,AGARWAL S.A relative position based algorithm to find out the longest common subsequence from multiple biological sequences[C]∥Proceedings of the 2010 International Conference on Computer and Communication Technology (ICCCT).2010:496-502.
 RIZVI S,AGARWAL P.A new index-based parallel algorithm for finding longest common subsequence in multiple dna sequences[C]∥International Conference in Cognitive Systems.Citeseer,2005.
 HAKATA K,IMAI H.Algorithms for the longest commonsubsequence problem for multiple strings based on geometric maxima[J].Optimization Methods and Software,1998,10(2):233-260.
 BOURQUE G,PEVZNER P A.Genome-scale evolution:reconstructing gene orders in the ancestral species[J].Genome research,2002,12(1):26-36.
 SHERIDAN R P,VENKATARAGHAVAN R.A systematicsearch for protein signature sequences[J].Proteins-Structure Function and Bioinformatics,1992,14(1):16-28.
|No related articles found!|