Add to ORKGArc-annotated sequences are useful in representing the structural in-formation of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced in [1], [2] as a frame-work for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures
International audienceGiven two arc-annotated sequences (S, P ) and (T, Q) representing RNA structur...
International audienceIn the recent past, RNA structure comparison has appeared as an important fiel...
Finding the longest common subsequence of a given set of input strings is a relevant problem arising...
AbstractArc-annotated sequences are useful in representing the structural information of RNA and pro...
Arc-annotated sequences are useful in representing the structural information of RNA and protein seq...
International audienceAn arc-annotated sequence is a sequence, over a given alphabet, with additiona...
AbstractWe present exact algorithms for the NP-complete LONGEST COMMON SUBSEQUENCE problem for seque...
AbstractArc-annotated sequences are useful in representing the structural information of RNA and pro...
Abstract. We present exact algorithms for the NP-complete Longest Common Subsequence problem for seq...
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computat...
International audienceIn molecular biology, RNA structure comparison and motif search are of great i...
We study pattern matching for arc-annotated sequences. An O(nm) time algorithm is given for the prob...
The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization probl...
Abstract. An arc-annotated string is a string of characters, called bases, augmented with a set of p...
International audienceGiven two arc-annotated sequences (S, P ) and (T, Q) representing RNA structur...
International audienceIn the recent past, RNA structure comparison has appeared as an important fiel...
Finding the longest common subsequence of a given set of input strings is a relevant problem arising...
AbstractArc-annotated sequences are useful in representing the structural information of RNA and pro...
Arc-annotated sequences are useful in representing the structural information of RNA and protein seq...
International audienceAn arc-annotated sequence is a sequence, over a given alphabet, with additiona...
AbstractWe present exact algorithms for the NP-complete LONGEST COMMON SUBSEQUENCE problem for seque...
AbstractArc-annotated sequences are useful in representing the structural information of RNA and pro...
Abstract. We present exact algorithms for the NP-complete Longest Common Subsequence problem for seq...
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computat...
International audienceIn molecular biology, RNA structure comparison and motif search are of great i...
We study pattern matching for arc-annotated sequences. An O(nm) time algorithm is given for the prob...
The longest arc-preserving common subsequence problem is an NP-hard combinatorial optimization probl...
Abstract. An arc-annotated string is a string of characters, called bases, augmented with a set of p...
International audienceGiven two arc-annotated sequences (S, P ) and (T, Q) representing RNA structur...
International audienceIn the recent past, RNA structure comparison has appeared as an important fiel...
Finding the longest common subsequence of a given set of input strings is a relevant problem arising...