Amanote Research

Amanote Research

    RegisterSign In

Recognition Algorithm for Probe Interval 2-Trees

British Journal of Mathematics & Computer Science
doi 10.9734/bjmcs/2016/28344
Full Text
Open PDF
Abstract

Available in full text

Date

January 10, 2016

Authors
Breeann FleschMatthew Nabity
Publisher

Sciencedomain International


Related search

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Skarbek's Algorithm for T-Ary Trees

Computer Journal
Computer Science
2005English

Randomized Trees for Real-Time Keypoint Recognition

English

Randomized Probe Selection Algorithm for Microarray Design

Journal of Theoretical Biology
StatisticsGeneticsProbabilityMolecular BiologyBiochemistryApplied MathematicsMicrobiology SimulationImmunologyBiological SciencesMedicineAgriculturalModeling
2007English

A 3/2-Approximation Algorithm for Finding Spanning Trees With Many Leaves in Cubic Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2011English

A General Algorithm for Pattern Recognition?

Behavioral and Brain Sciences
PhysiologyPhysiological PsychologyNeuropsychologyBehavioral Neuroscience
1989English

A Pyrenyl-Pna Probe for DNA and RNA Recognition

Artificial DNA: PNA and XNA
MedicineBiochemistryOrganic Chemistry
2010English

Fingerprint Recognition Algorithm

2017English

Distributed Kd-Trees for Ultra Large Scale Object Recognition

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy