10.1504/IJDMB.2011.045413International Journal of Data Mining and Bioinformatics56611-62
<p><b>Copyright information:</b></p><p>Taken from "Simultaneous identification of long similar subst...
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of si...
This paper is a survey of approaches and algorithms used for the automatic discovery of patterns in ...
10.1109/BIBE.2006.253315Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIB...
In the era of growing informatization of society more people deal with and more computing power is c...
In recent years, we have seen a rapid increase in the available DNA and protein data coming from var...
We consider the problem of automatic discovery of pat-terns and the corresponding subfamilies in a s...
The emergence of automated high-throughput sequencing technologies has resulted in a huge increase o...
We consider the constrained longest common subsequence problem with an arbitrary set of input string...
Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many ...
Bio-data analysis deals with the most vital discovering problem of similarity search and finding rel...
Copyright © 2015 Yun Xue et al.This is an open access article distributed under the Creative Commons...
The longest common subsequence problem (LCS) and the closest substring problem (CSP) are two models ...
The multiple longest common subsequence (MLCS) problem involves finding all the longest common subse...
Information in various applications is often expressed as character sequences over a finite alphabet...
<p><b>Copyright information:</b></p><p>Taken from "Simultaneous identification of long similar subst...
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of si...
This paper is a survey of approaches and algorithms used for the automatic discovery of patterns in ...
10.1109/BIBE.2006.253315Proceedings - Sixth IEEE Symposium on BioInformatics and BioEngineering, BIB...
In the era of growing informatization of society more people deal with and more computing power is c...
In recent years, we have seen a rapid increase in the available DNA and protein data coming from var...
We consider the problem of automatic discovery of pat-terns and the corresponding subfamilies in a s...
The emergence of automated high-throughput sequencing technologies has resulted in a huge increase o...
We consider the constrained longest common subsequence problem with an arbitrary set of input string...
Finding the longest common subsequence (LCS) of multiple strings is an NP-hard problem, with many ...
Bio-data analysis deals with the most vital discovering problem of similarity search and finding rel...
Copyright © 2015 Yun Xue et al.This is an open access article distributed under the Creative Commons...
The longest common subsequence problem (LCS) and the closest substring problem (CSP) are two models ...
The multiple longest common subsequence (MLCS) problem involves finding all the longest common subse...
Information in various applications is often expressed as character sequences over a finite alphabet...
<p><b>Copyright information:</b></p><p>Taken from "Simultaneous identification of long similar subst...
The constrained longest common subsequence (CLCS) problem was introduced as a specific measure of si...
This paper is a survey of approaches and algorithms used for the automatic discovery of patterns in ...
DOI
Add to ORKG