/*
 * Copyright (c) 1999 Johnny C. Lam.
 * All rights reserved.
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  The author makes no representations
 * about the suitability of this software for any purpose.  It is
 * provided "as is" without express or implied warranty.
 */

// -*- C++ -*-

#ifndef LONGEST_SEGMENT_H_INCLUDED
#define LONGEST_SEGMENT_H_INCLUDED

#ifndef SEGMENT_H_INCLUDED
#include "segment.h"
#endif

class HDictionary;

///////////////////////////////////////////////////////////////////////////
//
// LongestRunsProbability
//
// Concrete class derived from SegmentProbability.  The probability of a
// haplotype segment is calculated by noting the longest sub-segments
// which can be found in the dictionary in order to take into account
// the dependence within the segment.
//
///////////////////////////////////////////////////////////////////////////

class LongestRunsProbability : public SegmentProbability {
public:
    LongestRunsProbability(bool = false);
    
    probability	Probability(HDictionary*, const Haplotype&, size_type) const;
};

#include "longest_segment_inline.h"

#endif // LONGEST_SEGMENT_H_INCLUDED
