Sciweavers

16188 search results - page 2964 / 3238
» The Optimal PAC Algorithm
Sort
View
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
15 years 10 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
SIGMOD
1998
ACM
150views Database» more  SIGMOD 1998»
15 years 10 months ago
Extracting Schema from Semistructured Data
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
Svetlozar Nestorov, Serge Abiteboul, Rajeev Motwan...
ICCAD
1997
IEEE
144views Hardware» more  ICCAD 1997»
15 years 10 months ago
Exploiting off-chip memory access modes in high-level synthesis
Memory-intensive behaviors often contain large arrays that are synthesized into off-chip memories. With the increasing gap between on-chip and off-chip memory access delays, it is...
Preeti Ranjan Panda, Nikil D. Dutt, Alexandru Nico...
RECOMB
1998
Springer
15 years 10 months ago
A polyhedral approach to RNA sequence structure alignment
Ribonucleic acid (RNA) is a polymer composed of four bases denoted A, C, G, and U. It is a generally single-stranded molecule where the bases form hydrogen bonds within the same m...
Hans-Peter Lenhof, Knut Reinert, Martin Vingron
RECOMB
1998
Springer
15 years 10 months ago
Alignments without low-scoring regions
Given a strong match between regions of two sequences, how far can the match be meaningfully extended if gaps are allowed in the resulting alignment? The aim is to avoid searching...
Zheng Zhang 0004, Piotr Berman, Webb Miller
« Prev « First page 2964 / 3238 Last » Next »