Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
842
Non-contiguous sequence pattern queries
- In Proc. of Extending Database Technology (EDBT
, 2004
"... Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodology that indexes long sequences, in order to efficiently process such queries. The sequence data are decomposed into ta ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodology that indexes long sequences, in order to efficiently process such queries. The sequence data are decomposed
Tandem repeats finder: a program to analyze DNA sequences
, 1999
"... A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size, co ..."
Abstract
-
Cited by 961 (9 self)
- Add to MetaCart
A tandem repeat in DNA is two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats have been shown to cause human disease, may play a variety of regulatory and evolutionary roles and are important laboratory and analytic tools. Extensive knowledge about pattern size
Text Classification using String Kernels
"... We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily contiguo ..."
Abstract
-
Cited by 495 (7 self)
- Add to MetaCart
We propose a novel approach for categorizing text documents based on the use of a special kernel. The kernel is an inner product in the feature space generated by all subsequences of length k. A subsequence is any ordered sequence of k characters occurring in the text though not necessarily
Davenport-Schinzel Sequences and Their Geometric Applications
, 1998
"... An (n; s) Davenport-Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta \ ..."
Abstract
-
Cited by 439 (105 self)
- Add to MetaCart
An (n; s) Davenport-Schinzel sequence, for positive integers n and s, is a sequence composed of n distinct symbols with the properties that no two adjacent elements are equal, and that it does not contain, as a (possibly non-contiguous) subsequence, any alternation a \Delta \Delta \Delta b \Delta
The diploid genome sequence of an individual human
- PLoS Biol
"... Presented here is a genome sequence of an individual human. It was produced from;32 million random DNA fragments, sequenced by Sanger dideoxy technology and assembled into 4,528 scaffolds, comprising 2,810 million bases (Mb) of contiguous sequence with approximately 7.5-fold coverage for any given r ..."
Abstract
-
Cited by 293 (6 self)
- Add to MetaCart
Presented here is a genome sequence of an individual human. It was produced from;32 million random DNA fragments, sequenced by Sanger dideoxy technology and assembled into 4,528 scaffolds, comprising 2,810 million bases (Mb) of contiguous sequence with approximately 7.5-fold coverage for any given
1 Non-contiguous SCHEMA protein recombination
"... SCHEMA is a method of designing protein recombination libraries that contain a large fraction of functional proteins with a high degree of mutational diversity. In the previous chapter we illustrated the method for designing libraries by swapping contiguous sequence elements. Here, we introduce the ..."
Abstract
- Add to MetaCart
SCHEMA is a method of designing protein recombination libraries that contain a large fraction of functional proteins with a high degree of mutational diversity. In the previous chapter we illustrated the method for designing libraries by swapping contiguous sequence elements. Here, we introduce
Permutation pseudographs and contiguity
- COMBIN. PROBAB. COMPUT
, 2001
"... The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation σ of {1, 2,..., n} uniformly at random and taking the n edges {i, σ(i)}. We prove several contiguity results involving permutation pseudog ..."
Abstract
-
Cited by 10 (3 self)
- Add to MetaCart
pseudographs (contiguity is a kind of asymptotic equivalence of sequences of probability spaces). Namely, we show that a random 4-regular pseudograph is contiguous with the sum of two permutation pseudographs, the sum of a permutation pseudograph and a random Hamilton cycle, and the sum of a permutation
Isolation and direct complete nucleotide determination of entire genes. Characterization of a gene coding for 16S ribosomal RNA. Nucleic Acids Res
, 1989
"... Using a set of synthetic oligonucleotides homologous to broadly conserved sequences in-vitro amplification via the polymerase chain reaction followed by direct sequencing results in almost complete nucleotide determination of a gene coding for 16S ribosomal RNA. As a model system the nucleotide sequ ..."
Abstract
-
Cited by 186 (2 self)
- Add to MetaCart
sequence of the 16S rRNA gene of M.kansasii was determined and found to be 98.7 % homologous to that of M.bovis BCG. This is the first report on a contiguous sequence information of an entire amplified gene spanning 1.5 fcb without any subcloning procedures. INTRODTJCTIOH The analysis of nucleic acid
Non-contiguous word sequences for information retrieval
- In Proceedings of the 42nd annual meeting of the Association for Computational Lingustics, Workshop on Multiword Expressions: Integrating Processing
, 2004
"... The growing amount of textual information available electronically has increased the need for high performance retrieval. The use of phrases was long seen as a natural way to improve retrieval performance over the common document models that ignore the sequential aspect of word occurrences in docume ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
in documents, considering them as “bags of words”. However, both statistical and syntactical phrases showed disappointing results for large document collections. In this paper we present a recent type of multi-word expressions in the form of Maximal Frequent Sequences (Ahonen-Myka, 1999). Mined phrases rather
ABACAS: algorithm based automatic contiguation of assembled sequences
- Bioinformatics
, 2009
"... There is increasing interest in sequencing the genomes of strains that are closely related to existing finished reference genomes. Recently a number of de novo and mapping based assemblers have been developed to produce high quality draft genomes from second generation sequencing technology reads. H ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
There is increasing interest in sequencing the genomes of strains that are closely related to existing finished reference genomes. Recently a number of de novo and mapping based assemblers have been developed to produce high quality draft genomes from second generation sequencing technology reads
Results 1 - 10
of
842
