A Comparison Sequence for Nova Lacertae

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Motivations for Sequence Comparison

Hieroglyph Demotic Greek From 452 to 1822, "Egypt was silent": The ability to read hieroglyphic inscriptions on monuments and tombs, and papyrus texts using cursive scripts like demotic, was lost.

متن کامل

A Comparison of Sequence-to-Sequence Models for Speech Recognition

In this work, we conduct a detailed evaluation of various allneural, end-to-end trained, sequence-to-sequence models applied to the task of speech recognition. Notably, each of these systems directly predicts graphemes in the written domain, without using an external pronunciation lexicon, or a separate language model. We examine several sequence-to-sequence models including connectionist tempo...

متن کامل

Sequence Covering Similarity for Symbolic Sequence Comparison

This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a pair-wise distance to compare two symbolic sequences. We show that this covering distance is a semimetric. Few examples are given to show how this string semimetric ...

متن کامل

A unified statistical framework for sequence comparison and structure comparison.

We present an approach for assessing the significance of sequence and structure comparisons by using nearly identical statistical formalisms for both sequence and structure. Doing so involves an all-vs.-all comparison of protein domains [taken here from the Structural Classification of Proteins (scop) database] and then fitting a simple distribution function to the observed scores. By using thi...

متن کامل

Bounds for Parametric Sequence Comparison

We consider the problem of computing a global alignment between two or more sequences subject to varying mismatch and indel penalties. We prove a tight 3(n=2 )+O(n log n) bound on the worst-case number of distinct optimum alignments for two sequences of length n as the parameters are varied. This re7nes a O(n) upper bound by Gus7eld et al., answering a question posed by Pevzner and Waterman. Ou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 1938

ISSN: 0035-8711,1365-2966

DOI: 10.1093/mnras/99.1.40