A branch-and-cut approach to the repetition-free longest common subsequence problem
References (7)
- Adi, S. S., M. Braga, C. G. Fernandes, C. E. Ferreira, F. V. Martinez, M.-F. Sagot, M. A. Stefanes, C. Tjandraatmadja...
- et al.
Exemplar longest common subsequence
IEEE/ACM Trans. Comput. Biol. Bioinformatics
(2007) - et al.
Variants of constrained longest common subsequence
Cited by (8)
Comparing incomplete sequences via longest common subsequence
2019, Theoretical Computer ScienceCitation Excerpt :For example, the comparison of biological sequences provides a measure of their similarities and differences, aiming at understanding whether they encode similar/different functionalities. Different variants of LCS have been considered in the last years for the comparison of two genomes, for example the constrained longest common subsequence [4–8] or the repetition-free longest common subsequence and variants thereof [9–12]. These approaches assume that the input sequences are complete, that is there are no missing data in the considered sequences.
Repetition-free longest common subsequence of random sequences
2016, Discrete Applied MathematicsCitation Excerpt :Some other extensions of these two measures were considered under the name of constrainedLCS and doubly-constrainedLCS [7]. All of these variants were shown to be hard to compute [1,5–7], so some heuristics and approximation algorithms for them were proposed and experimentally tested [1,6,14,10]. It is worth mentioning that the above discussion refers to sequences randomly, uniformly, and independently chosen over an alphabet.
The constrained shortest common supersequence problem
2013, Journal of Discrete AlgorithmsCitation Excerpt :Since the order in which genes appear in the genomes seems to be relevant when measuring their similarities, LCS and SCS are two promising approaches to compare genomes. In the last years, different variants of longest common subsequence and shortest common supersequence have been proposed [5,1,6,11,22,7,3,13]. These versions of LCS and SCS usually impose a constraint on the common subsequence/supersequence to be computed.
Efficient algorithms for the longest common subsequence problem with sequential substring constraints
2013, Journal of ComplexityLongest Order Conserved Repetition-free Subsequences
2023, Proceedings - 2023 2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023Hybrid heuristics: for the repetition-free longest common subsequence problem with index-gene
2023, Proceedings - 2023 2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023
- 1
Supported by FAPESP (proc. 07/57149-5).