Yüklüyor......
A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem
Searching for the Multiple Longest Common Subsequences (MLCS) of multiple sequences is a classical NP-hard problem, which has been used in many applications. One of the most effective exact approaches for the MLCS problem is based on dominant point graph, which is a kind of directed acyclic graph (D...
Kaydedildi:
| Yayımlandı: | Front Genet |
|---|---|
| Asıl Yazarlar: | , |
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Frontiers Media S.A.
2017
|
| Konular: | |
| Online Erişim: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5552671/ https://ncbi.nlm.nih.gov/pubmed/28848600 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3389/fgene.2017.00104 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|