A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem

Overview of attention for article published in Frontiers in Genetics, August 2017

Altmetric Badge

Mentioned by

twitter: 2 X users

Citations

dimensions_citation: 19 Dimensions

Readers on

mendeley: 10 Mendeley

Summary X Dimensions citations

So far, Altmetric has seen 2 X posts from 2 X users, with an upper bound of 6,037 followers.

A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem: Zhan Peng, Yuping Wang https://t.co/dVPxYO2tBI

Reply Repost Favourite

A #Novel #Efficient #Graph #Model for the #Multiple #Longest #Common #Subsequences ( #MLCS ) #Problem https://t.co/kSoWOIub53

Reply Repost Favourite

This page shows the most recent X posts that mention this research output.

Click here to find out how to access more activity.