A Fast Multiple Longest Common Subsequence (MLCS) Algorithm

Wang, Qingguo; Korkin, Dmitry; Shang, Yi

doi:10.1109/TKDE.2010.123

Record: found
Abstract: not found
Article: not found

A Fast Multiple Longest Common Subsequence (MLCS) Algorithm

Author(s): Qingguo Wang , Dmitry Korkin , Yi Shang

Publication date (Print): March 2011

Journal: IEEE Transactions on Knowledge and Data Engineering

Publisher: Institute of Electrical and Electronics Engineers (IEEE)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 36

Record: found
Abstract: not found
Article: not found

Identification of common molecular subsequences.

T.F. Smith, M.S. Waterman (1981)

0 comments Cited 1698 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: found
Article: not found

Pfam: clans, web tools and services

Robert D. Finn, Jaina Mistry, Benjamin Schuster-Böckler … (2005)

Pfam is a database of protein families that currently contains 7973 entries (release 18.0). A recent development in Pfam has enabled the grouping of related families into clans. Pfam clans are described in detail, together with the new associated web pages. Improvements to the range of Pfam web tools and the first set of Pfam web services that allow programmatic access to the database and associated tools are also presented. Pfam is available on the web in the UK (), the USA (), France () and Sweden ().