Results 1  10
of
741,976
The Longest Common Subsequence Problem for ArcAnnotated Sequences
 In Proc. of 11th CPM, number 1848 in LNCS
, 2000
"... . Arcannotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arcpreserving common subsequence problem has been introduced in [6, 7] as a framework for studying the similarity of arcannotated sequences. In this paper, we con ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
. Arcannotated sequences are useful in representing the structural information of RNA and protein sequences. Recently, the longest arcpreserving common subsequence problem has been introduced in [6, 7] as a framework for studying the similarity of arcannotated sequences. In this paper, we
The Longest Common Subsequence Problem for ArcAnnotated Sequences
"... Arcannotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arcpreserving common subsequence problem has been introduced in [1], [2] as a framework for studying the similarity of arcannotated sequences. In this paper, we consider arcan ..."
Abstract
 Add to MetaCart
Arcannotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arcpreserving common subsequence problem has been introduced in [1], [2] as a framework for studying the similarity of arcannotated sequences. In this paper, we consider arcannotated
Exact Algorithms for the Longest Common Subsequence Problem for ArcAnnotated Sequences
 Diploma thesis, Universität Tübingen, Fed. Rep. of
, 2002
"... Contents 1 Introduction 5 2 Biological Motivation 9 2.1 Some Molecular Biology . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Biological Motivation . . . . . . . . . . . . . . . . . . . . . . . . . 12 3 Some Basic Definitions 13 3.1 LCS and Some Problems from Graph Theory . . . . . . . . . . . ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
. . . . . . . . . . . . . . . . . . . . . . 29 4.3 Complexity of ArcPreserving Subsequence Problem . . . . . . . 30 4.4 Overview of This Work . . . . . . . . . . . . . . . . . . . . . . . 31 5 cfragment, cdiagonal LAPCS 33 5.1 cfragment<F10
Pattern Matching for ArcAnnotated Sequences
 In Proc. of 22nd FSTTCS, number 2556 in LNCS
, 2002
"... A study of pattern matching for arcannotated sequences is started. An O(nm) time algorithm is given to determine whether a length m sequence with nested arc annotations is an arcpreserving subsequence of a length n sequence with nested arc annotations, called APS(nested,nested). Arcannotated ..."
Abstract

Cited by 30 (2 self)
 Add to MetaCart
A study of pattern matching for arcannotated sequences is started. An O(nm) time algorithm is given to determine whether a length m sequence with nested arc annotations is an arcpreserving subsequence of a length n sequence with nested arc annotations, called APS(nested,nested). Arcannotated
How to compare arcannotated sequences : the alignment hierarchy
 In 13th Symposium on String Processing and Information Retrieval (SPIRE’06), volume 4209 of LNCS
, 2006
"... Abstract. We describe a new unifying framework to express comparison of arcannotated sequences, which we call alignment of arcannotated sequences. We first prove that this framework encompasses main existing models, which allows us to deduce complexity results for several cases from the literature ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
Abstract. We describe a new unifying framework to express comparison of arcannotated sequences, which we call alignment of arcannotated sequences. We first prove that this framework encompasses main existing models, which allows us to deduce complexity results for several cases from
The Comparison of RNA Secondary Structures with Nested ArcAnnotation
"... In recent years, RNA structural comparison becomes a crucial problem in bioinformatics research. Generally, it is a popular approach for representing the RNA secondary structures with arcannotation sets. Several methods can be used to compare two RNA structures, such as tree edit distance, longest ..."
Abstract
 Add to MetaCart
In recent years, RNA structural comparison becomes a crucial problem in bioinformatics research. Generally, it is a popular approach for representing the RNA secondary structures with arcannotation sets. Several methods can be used to compare two RNA structures, such as tree edit distance, longest
Algorithms for the longest common subsequence problem
 J. ACM
, 1977
"... AaS~ACT Two algorithms are presented that solve the longest common subsequence problem The first algorithm is applicable in the general case and requires O(pn + n log n) time where p is the length of the longest common subsequence The second algorithm requires time bounded by O(p(m + 1 p)log n) In ..."
Abstract

Cited by 221 (2 self)
 Add to MetaCart
AaS~ACT Two algorithms are presented that solve the longest common subsequence problem The first algorithm is applicable in the general case and requires O(pn + n log n) time where p is the length of the longest common subsequence The second algorithm requires time bounded by O(p(m + 1 p)log n
Author manuscript, published in "19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Cartagena de Indias: Colombia (2012)" The longest common subsequence problem with
, 2012
"... crossingfree arcannotated sequences ..."
Fast ArcAnnotated Subsequence Matching in Linear Space
"... Abstract. An arcannotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arcannotated strings P and Q the arcpreserving subsequence problem is to determine if P can be obtained from Q by deleting bases from Q. Whenever ..."
Abstract
 Add to MetaCart
Abstract. An arcannotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arcannotated strings P and Q the arcpreserving subsequence problem is to determine if P can be obtained from Q by deleting bases from Q. Whenever
Results 1  10
of
741,976